(LeetCode)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 nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn‘t matter what you leave beyond the new length.

# -*- coding:utf-8 -*-
__author__ = 'jiuzhang'
class Solution(object):
    def removeDuplicates(self, nums):
        L = len(nums)
        i = 0
        while i < L - 1:
            if nums[i] == nums[i + 1]:
                del nums[i + 1]
                L -= 1
            else:
                i += 1
        return L

(LeetCode)Remove Duplicates from Sorted Array --- 有序列表去重

标签：

原文地址：http://blog.csdn.net/u012965373/article/details/52208656