Java code
class Solution {
public int removeDuplicates(int[] nums) {
int count1 = 0;
int count2 = 0;
int temp = 0;
for(int i = 0; i < nums.length - count1; i++) {
for(int j = i + 1; j < nums.length - count1; j++) {
if(nums[i] == nums[j]) {
temp = nums[nums.length - count1 - 1];
nums[nums.length - count1 - 1] = nums[j];
nums[j] = temp;
count1++;
if(nums[i] == nums[j]) {
j--;
}
}
}
count2++;
}
for(int i = 0; i < count2 - 1; i++) {
for(int j = i; j < count2 - 1; j++) {
if(nums[i] > nums[j + 1]) {
temp = nums[i];
nums[i] = nums[j + 1];
nums[j + 1] = temp;
}
}
}
return count2;
}
}
提交记录
