763. Partition Labels

内容：
A string 

S

 of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representing the size of these parts.

思路：
从一开始那些key point就定下来了，只要往下走下去就好了，一步步往后推

public static int removeDuplicates(int[] nums) {
if(nums.length<2){
return nums.length;
}
int temp=nums[0];
int insert=1;
boolean gate=false;
for(int i=1;i<nums.length;i++){
if(nums[i]==temp){
if(gate){
continue;
}else{
gate=true;
nums[insert++]=temp;
}
}else{
gate=false;
nums[insert++]=nums[i];
temp=nums[i];
}
}
if(insert<nums.length){
nums[insert]=nums[insert-1]+1;
}
return insert;
}