wuyijia

ÕªÒª£º 491. µÝÔö×ÓÐòÁÐ ²»¶ÔÔ­Êý×é½øÐÐÅÅÐò£¬ÀûÓÃset¶Ôͬ²ãµÄ×Ó¼¯½øÐÐÈ¥ÖØ¡£ 1 class Solution: 2 def findSubsequences(self, nums): 3 result = [] 4 path = [] 5 self.backtracking(nums, 0, pat ÔĶÁÈ«ÎÄ

ÕªÒª£º 257. ¶þ²æÊ÷µÄËùÓз¾¶ 1 # Definition for a binary tree node. 2 # class TreeNode: 3 # def __init__(self, val=0, left=None, right=None): 4 # self.val = val 5 # ÔĶÁÈ«ÎÄ

ÕªÒª£º Á´±íÎÊÌ⣺˫ָÕë¡¢µü´ú·¨¡¢µÝ¹é·¨£¨ÌìÈ»¿ÉÓã©¡¢ÐéÄâÍ·½Úµã Ë«Á´±í ¼È¿ÉÒÔÏòÇ°²éѯҲ¿ÉÒÔÏòºó²éѯ¡£ Ñ­»·Á´±í£¬¹ËÃû˼Ò壬¾ÍÊÇÁ´±íÊ×βÏàÁ¬¡£Ñ­»·Á´±í¿ÉÒÔÓÃÀ´½â¾öԼɪ·ò»·ÎÊÌâ¡£ 234. »ØÎÄÁ´±í 1 # Definition for singly-linked list. 2 # class ListN ÔĶÁÈ«ÎÄ

ÕªÒª£º 35. ËÑË÷²åÈëλÖà 1 class Solution: 2 def searchInsert(self, nums: List[int], target: int) -> int: 3 left, right = 0, len(nums)-1 4 5 while left <= right: #×ó ÔĶÁÈ«ÎÄ

ÕªÒª£º 217. ´æÔÚÖظ´ÔªËØ 1 class Solution: 2 def containsDuplicate(self, nums: List[int]) -> bool: 3 #·½·¨1£ºsetÈ¥ÖØ£¬Ö±½Ó±È½ÏÈ¥ÖØÖ®ºóÊý×鳤¶È 4 if len(set(nums)) != len(nums): 5 re ÔĶÁÈ«ÎÄ

ÕªÒª£º 54. ÂÝÐý¾ØÕó 1 class Solution: 2 def spiralOrder(self, matrix: List[List[int]]) -> List[int]: 3 m, n = len(matrix), len(matrix[0]) 4 res = [] #´æ·Å±éÀúºóµÄ½á¹û 5 ÔĶÁÈ«ÎÄ

ÕªÒª£º 20. ÓÐЧµÄÀ¨ºÅ 1 class Solution: 2 #±éÀúÍê×Ö·û´®ºó£¬Õ»Êǿյģ¬ËµÃ÷È«²¿Æ¥ÅäÁË 3 def isValid(self, s: str) -> bool: 4 stack = [] 5 #¼ôÖ¦ 6 if len(s) % 2 != 0: 7 return False 8 9 f ÔĶÁÈ«ÎÄ

ÕªÒª£º 933. ×î½üµÄÇëÇó´ÎÊý 1 class RecentCounter: 2 3 def __init__(self): 4 self.q = collections.deque() 5 6 def ping(self, t: int) -> int: 7 self.q.append(t) 8 9 w ÔĶÁÈ«ÎÄ

ÕªÒª£º 203. ÒƳýÁ´±íÔªËØ Ò²¿ÉÒÔÓÃÕ»½â¾ö£º£¨³ÌÐòԱСÐÜ£© 1 # Definition for singly-linked list. 2 # class ListNode: 3 # def __init__(self, val=0, next=None): 4 # self.val = val 5 ÔĶÁÈ«ÎÄ

ÕªÒª£º 485. ×î´óÁ¬Ðø 1 µÄ¸öÊý 1 class Solution: 2 def findMaxConsecutiveOnes(self, nums: List[int]) -> int: 3 maxCount = count = 0 4 5 for i, num in enumerate(nums) ÔĶÁÈ«ÎÄ