删除排序数组中的重复项

最新推荐文章于 2024-09-14 20:30:05 发布

Healer_mo

最新推荐文章于 2024-09-14 20:30:05 发布

阅读量87

点赞数 1

分类专栏：小算法文章标签：算法 java

本文链接：https://blog.csdn.net/Healer_mo/article/details/113996285

版权

小算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

下面展示测试代码

package PowerButton;

public class Demo01 {
    public static void main(String[] args) {
        int[] nums = {5, 6, 6, 8, 8, 8, 9, 9};
        for (int i : nums){
            System.out.print(i+"");
        }
        int num = removeDuplicates(nums);
        System.out.println(num);
        for (int i = 0; i < num; i ++ ){
            System.out.print(nums[i]+"");
        }
    }

    public static int removeDuplicates(int[] nums) {
        if (nums.length == 0) return 0;
        int i = 0;
        for (int j = 1; j < nums.length; j++) {
            if (nums[j] != nums[i]) {
                i++;
                nums[i] = nums[j];
            }
        }
        return i + 1;
    }
}

另外一种解法（其实换汤不换药）：

package PowerButton;

public class Demo01 {
    public static void main(String[] args) {
        int[] nums = {5, 6, 6, 8, 8, 8, 9, 9};
        for (int i : nums){
            System.out.print(i+"");
        }
        int numsSize = nums.length;
        int num = removeDuplicates(nums,numsSize);
        System.out.println(num);
        for (int i = 0; i < num; i ++ ){
            System.out.print(nums[i]+"");
        }
    }

    public static int removeDuplicates(int[] nums, int numsSize){
        int j = numsSize;
        if(j > 1){
            j = 1;
            for(int i = 1; i < numsSize; i ++){
                if(nums[i] == nums[i - 1]){
                    continue;
                } else{
                    nums[j] = nums[i];
                    j++;
                }
            }
        }
        return j;
    }
}