01 2024 档案
摘要：class ListNode: def __init__(self, val=0, next=None): self.val = val self.next = next class Solution: def deleteDuplicates(self, head: Optional[ListNo
阅读全文
摘要：class ListNode: def __init__(self, val=0, next=None): self.val = val self.next = next class SingleLinkList: def __init__(self,node=None): self.__head=
阅读全文
摘要：斐波那契数列： class Solution: def climbStairs(self, n: int) -> int: if n==1: return 1 s=[0]*(n+1) s[1]=1 s[2]=2 for i in range(3,n+1): s[i]=s[i-1]+s[i-2] re
阅读全文
摘要：暴力搜索 class Solution: def mySqrt(self, x: int) -> int: if x>=100 and x<10000: i=10 elif x>=10000 and x<1000000: i=100 elif x>=1000000: i=1000 else: i=0
阅读全文
摘要：自己写的 class Solution: def addBinary(self, a: str, b: str) -> str: a_len=len(a) b_len=len(b) if a_len<b_len: temp=b b=a a=temp a_len = len(a) b_len = le
阅读全文
摘要：自己写的 class Solution: def plusOne(self, digits) : digits_len=len(digits) if digits[-1]!=9: digits[-1]=digits[-1]+1 return digits if digits[-1]==9: digi
阅读全文
摘要：自己写的 class Solution: def lengthOfLastWord(self, s: str) -> int: s_list=s.split(" ") flag=0 i=-1 while flag==0: word_len=len(s_list[i]) if word_len!=0:
阅读全文
摘要：自己写的 class Solution: def searchInsert(self, nums, target): nums_len = len(nums) if target>nums[nums_len-1]: return nums_len if target<nums[0]: return
阅读全文
摘要：自己写的 class Solution: def strStr(self, haystack: str, needle: str) -> int: haystack_len = len(haystack) needle_len = len(needle) if haystack == needle:
阅读全文
摘要：自己写的： class Solution: # 1 2 2 3 3 4 def removeElement(self, nums, val): numms_len = len(nums) if numms_len == 0: return numms_len i = 0 while i < numm
阅读全文
摘要：class Solution: # 1 2 2 3 4 def removeDuplicates(self, nums): nums_len = len(nums) # 5 if nums_len == 0: return nums_len if nums_len == 1: return nums
阅读全文
摘要：class Solution(object): def mergeTwoLists(self, list1, list2): if not list1: return list2 if not list2: return list1 result = None while list1 or list
阅读全文
摘要：暴力求解 class Solution: def isValid(self, s: str) -> bool: s_len = len(s) s_list = list() kuohao_list = ['(', ')', '[', ']', '{', '}', 'n'] for i in rang
阅读全文
摘要：第一版 用find函数 但不能找出开头有重复的 class Solution:#不能找开头有重复的 def longestCommonPrefix(self, strs): str_num=len(strs) com_list=list() min_len=100 for i in strs: mi
阅读全文
