class Solution:
def removeDuplicates(self, nums: List[int]) -> int:
if (len(nums) == 0):
return 0;
i = 0;
for j in range(1,len(nums)):
if nums[j] != nums[i]:
i += 1
nums[i] = nums[j]
del nums[i+1::]
return i + 1
买卖股票的最佳时机 II
class Solution:
def maxProfit(self, prices: List[int]) -> int:
maxprofit = 0;
for i in range(1,len(prices)):
if (prices[i] > prices[i - 1]):
maxprofit += prices[i] - prices[i - 1];
return maxprofit;
给定一个数组,将数组中的元素向右移动 k 个位置,其中 k 是非负数。
class Solution:
def rotate(self, nums: List[int], k: int) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
for i in range(k):
nums.insert(0,nums.pop(-1))
给定一个整数数组,判断是否存在重复元素。
class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
set_length = len(set(nums))
if set_length == len(nums):
return False
return True