标签：length hang back sel lis att rem ext nbsp
Given an array and a value, remove all instances of that value in place and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
The order of elements can be changed. It doesn‘t matter what you leave beyond the new length.
1 class Solution(object): 2 def removeElement(self, nums, val): 3 """ 4 :type nums: List[int] 5 :type val: int 6 :rtype: int 7 """ 8 start, end = 0, len(nums) - 1 9 while start <= end: 10 if nums[start] == val: 11 nums[start], nums[end], end = nums[end], nums[start], end - 1 12 else: 13 start +=1 14 return start
将不用的放到最后
1 class Solution(object): 2 def removeElement(self, nums, val): 3 """ 4 :type nums: List[int] 5 :type val: int 6 :rtype: int 7 """ 8 for i in nums[:]: 9 if i == val: 10 nums.remove(val) 11 return len(nums)
nums 和 nums[:] 的区别？？
标签：length hang back sel lis att rem ext nbsp
原文地址：http://www.cnblogs.com/fullest-life/p/6541322.html
