20.?有效括號? 48ms

class Solution:def isValid(self, s):""":type s: str:rtype: bool"""if len(s) % 2 :return Falsebrackets = {'(': ')', '{': '}', '[': ']'}stack = []for i in s:if i in brackets:stack.append(i)else:if not stack or brackets[stack.pop()] != i:return Falseif stack:return Falsereturn True

26.刪除排序數(shù)組中的重復(fù)項? 96ms

class Solution:def removeDuplicates(self, nums):""":type nums: List[int]:rtype: int"""if len(nums) <= 1:return len(nums)s = 0for f in range(1, len(nums)):if nums[s] != nums[f]:s += 1nums[s] = nums[f]return s + 1

27.移除元素? 56ms

class Solution:def removeElement(self, nums, val):""":type nums: List[int]:type val: int:rtype: int"""if val not in nums:return len(nums)while val in nums:nums.remove(val)return len(nums)

28.實現(xiàn)strStr()? 48ms

class Solution:def strStr(self, haystack, needle):""":type haystack: str:type needle: str:rtype: int"""if not needle:return 0if needle not in haystack:return -1else:return haystack.index(needle)

35.搜索插入位置? 48ms

class Solution:def searchInsert(self, nums, target):""":type nums: List[int]:type target: int:rtype: int"""if target in nums:return nums.index(target)if target < nums[0]:return 0if target > nums[-1]:return len(nums)for i in range(len(nums)-1):if nums[i]<target and nums[i+1]>target:return i+1

?

轉(zhuǎn)載于:https://www.cnblogs.com/FanMLei/p/10501003.html

總結(jié)

以上是生活随笔為你收集整理的Leet Code OJ 简单（二）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。