leetcoe系列之删除数组中的重复值

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/zhao__zhen/article/details/88389262

import org.junit.Test;

public class RemoveDuplicates {
    /**
     * @param args
     */
     @Test
    public void main1() {
        int[] nums = {0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4};
        int k = 0;
        for (int j = 1; j < nums.length; j++) {
            if (nums[j] != nums[k]) {
                nums[++k] = nums[j];
            }
        }

        for (int i = 0; i < k + 1; i++) {
            System.out.println(nums[i]);
        }
 		return k + 1;
	
    }

    /**
     * 官方题解，自己手撸一遍
     */

    @Test
    public void sol() {
        int[] nums = {0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4};
        int i = 0;
        for (int j = 1; j < nums.length; j++) {
            if (nums[j] != nums[i]) {
                i++;
                nums[i] = nums[j];
            }
        }

        for (int k = 0; k < i + 1; k++) {
            System.out.println(nums[k]);
        }
    }

}