【LeetCode with Python】 Remove Duplicates from Sorted Array

博客域名： http://www.xnerv.wang
原题页面： https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/
题目类型：
难度评价：★
本文地址： http://blog.csdn.net/nerv3x3/article/details/3465656

Given a sorted array, remove the duplicates in place such that each element appear onlyonce 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].

有序数组的去重。关键在于下标操作，不要每次都整体移动后面的元素。

class Solution:  
    # @param a list of integers
    @return an integer
    def removeDuplicates(self, A):
    if None == A:
        return 0
    len_A = len(A)
    if len_A <= 1:
        return len_A
    
    m = 0
    n = 1
    while n < len_A:
        if A[m] != A[n]:
        m += 1
        if m != n:
            A[m] = A[n]
        n += 1
    return m + 1