weixin_44894374的博客

class Solution: def reverseWords(self, s: str) -> str: s=s+" " stack,res=[],"" for i in s: stack.append(i) if i==" ": while(stack): res=res+stack.pop() retur

class Solution: def reverseString(self, s: List[str]) -> None: """ Do not return anything, modify s in-place instead. """ for i in range(len(s)//2): s[i],s[-i-1]=s[-i-1],s[i]class Solution: def rever

class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: for i in range(len(strs[0])): for string in strs[1: ]: if i>=len(string) or string[i]!=strs[0][i]: return string[0][ :i

class Solution: def isValid(self, s: str) -> bool: lookup={"(":")","[":"]","{":"}"} stack=[] for i in s: if i in lookup: stack.append(i) elif len(stack)==0 or lookup[stack.pop()]!=i:

class Solution: def findUnsortedSubarray(self, nums: List[int]) -> int: n=len(nums) right=0 max_nums=nums[0] for i in range(n): if nums[i] >= max_nums: max_nums=nums[i] else.

class Solution: def findDuplicates(self, nums: List[int]) -> List[int]: ans=[] for i in nums: if nums[abs(i)-1]>0: nums[abs(i)-1]*=-1 else: ans.append(abs(i)) return

class Solution: def findDisappearedNumbers(self, nums: List[int]) -> List[int]: a=set(nums) b=set(i for i in range(1,len(nums)+1)) return list(b-a)

class Solution: def moveZeroes(self, nums: List[int]) -> None: """ Do not return anything, modify nums in-place instead. """ pos=0 for i in range(len(nums)): if nums[i]: nums[pos]=.

class Solution: def majorityElement(self, nums: List[int]) -> int: return sorted(nums)[len(nums)//2]class Solution: def majorityElement(self, nums: List[int]) -> int: index,cnt=0,1 for i in range(1,len(nums)): .

class Solution: def maxProfit(self, prices: List[int]) -> int: min_price,max_profit=float("inf"),0 for i in prices: min_price=min(min_price,i) max_profit=max(max_profit,i-min_price) return max_profit.

class Solution: def searchInsert(self, nums: List[int], target: int) -> int: if target> nums[len(nums)-1]: return len(nums) for i in range(len(nums)): if nums[i]>=target: return i .

class Solution: def removeElement(self, nums: List[int], val: int) -> int: pre=0 while pre<len(nums): if nums[pre]==val: nums.pop(pre) else: pre+=1 return len(nums).

class Solution: def removeDuplicates(self, nums: List[int]) -> int: pre,cur =0,1 while cur < len(nums): if nums[pre]==nums[cur]: nums.pop(cur) else: pre+=1 c.

class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: dict={} for i in range(len(nums)): if target - nums[i] not in dict: dict[nums[i]] = i else: return .

class Solution: def maxSubArray(self, nums: List[int]) -> int: if max(nums)<0: return max(nums) local_nums,global_nums = 0,0 for i in nums: local_nums=max (0,local_nums+i) global_nums=max (local_nu.