1 class Solution {
 2     public int removeDuplicates(int[] nums) {
 3      int length = nums.length - 1;
 4         for (int i = 0; i <= length; i++) {
 5             for (int j = i + 1; j <= length; j++) {
 6                 if (nums[i] == nums[j]) {
 7                     for (int k = i; k <length ; k++) {
 8                         nums[k] = nums[k + 1];
 9                     }
10                     nums[length] = 0;
11                     length--;
12                     j--;
13                 }
14             }
15         }
16         length++;
17         return length;
18             
19 }
20 }

相关文章:

  • 2021-08-27
  • 2021-09-01
  • 2021-12-19
  • 2021-11-12
猜你喜欢
  • 2021-05-26
  • 2021-08-15
  • 2022-12-23
  • 2022-01-31
  • 2021-11-22
  • 2022-01-07
  • 2022-12-23
相关资源
相似解决方案