27. Remove Element
Leetcode link for this question
Discription:
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.
Example:
Given input array nums = [3,2,2,3], val = 3
Your function should return length = 2, with the first two elements of nums being 2.
Analyze:
Code 1 :
class Solution(object):
def removeElement(self, nums, val):
"""
:type nums: List[int]
:type val: int
:rtype: int
"""
i=0
while i<len(nums):
if nums[i]==val:
nums.pop(i)
i-=1
i+=1
return len(nums)
Submission Result:
Status: Accepted
Runtime: 72 ms
Ranking: beats 5.50%
Code 2 :
class Solution(object):
def removeElement(self, nums, val):
"""
:type nums: List[int]
:type val: int
:rtype: int
"""
p1,p2=0,len(nums)-1
if p2<1 and val in nums:
return 0
while p1<=p2:
if nums[p2]==val:
p2-=1
continue
elif nums[p1]!=val:
p1+=1
continue
else:
nums[p1],nums[p2]=nums[p2],nums[p1]
return p2+1
Submission Result:
Status: Accepted
Runtime: 64 ms
Ranking: beats 18.83%
本文详细解析了LeetCode上的第27题——移除元素的问题,提供了两种不同的Python实现方案并分析了它们的时间效率。
286

被折叠的 条评论
为什么被折叠?



