LeetCode 26 — Remove Duplicates from Sorted Array(C++ Java Python)

版权声明:本文为博主原创文章,遵循 CC 4.0 by-sa 版权协议,转载请附上原文出处链接和本声明。
本文链接:https://blog.csdn.net/dragon_dream/article/details/19757047

题目:http://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,
Given input array A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

题目翻译:

给定一个有序数组,原地删除重复元素,使得每个元素只出现一次,并返回新的长度。
不为另一个数组分配额外空间,必须用常量内存做到这一点。
例如,
给定输入数组 A = [1,1,2],
函数应返回长度 = 2,A现在是[1,2]。

分析:

        遍历,跳过重复元素。时间复杂度O(n)。

C++实现:

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        if(n == 0)
    	{
    		return 0;
    	}

    	int index = 0;
    	for(int i = 1; i < n; ++i)
    	{
    		if(A[i] != A[index])
    		{
    			++index;
    			A[index] = A[i];
    		}
    	}

    	return index + 1;
    }
};
Java实现:
public class Solution {
    public int removeDuplicates(int[] A) {
        if(A.length == 0) {
    		return 0;
    	}
    	if(A.length == 1) {
    		return 1;
    	}
    	
        int index = 0;
        for(int i = 1; i < A.length; ++i) {
        	if(A[i] != A[index]) {
        		++index;
        		A[index] = A[i];
        	}
        }
        
        return index + 1;
    }
}
Python实现:
class Solution:
    # @param a list of integers
    # @return an integer
    def removeDuplicates(self, A):
        if len(A) == 0:
            return 0
        if len(A) == 1:  # to make it clear
            return 1     # (without this also works well)
        
        index = 0
        for i in A[1:]:
            if i != A[index]:
                index += 1
                A[index] = i
                          
        return index + 1 
        感谢阅读,欢迎评论!

展开阅读全文

没有更多推荐了,返回首页