LintCode: 删除排序数组中的重复数字

题目:删除一个数组中重复的数字,并返回新数组的长度

解法:

public class Solution {
    public int removeDuplicates(int[] A) {
        if (A == null || A.length == 0) {
            return 0;
        }
        
        int size = 0;
        for (int i = 0; i < A.length; i++) {
            if (A[i] != A[size]) {
                A[++size] = A[i];
            }
        }
        return size + 1;
    }
}

猜你喜欢

转载自blog.csdn.net/cblstc/article/details/79393162
今日推荐