SummerHmh的博客

题目链接：https://leetcode.com/problems/reverse-words-in-a-string-iii/代码class Solution: def reverseWords(self, s: str) -> str: n=len(s) start=0 res='' i=0 w...

题目链接：https://leetcode.com/problems/reverse-linked-list/代码# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = None...

题目链接：https://leetcode.com/problems/majority-element/代码class Solution(object): def majorityElement(self, nums): """ :type nums: List[int] :rtype: int """ f...

题目链接：https://leetcode.com/problems/intersection-of-two-linked-lists/submissions/代码# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x#...

题目链接：https://leetcode.com/problems/min-stack/submissions/代码class MinStack: def __init__(self): """ initialize your data structure here. """ self.stack_list=[] ...

题目链接：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/代码class Solution: def maxProfit(self, prices) -> int: if len(prices)<1: return 0 profit=0 min_...

题目链接：https://leetcode.com/problems/best-time-to-buy-and-sell-stock/代码class Solution: def maxProfit(self, prices: List[int]) -> int: n,res = len(prices),0 dp=[0]*n for ...

题目链接：https://leetcode.com/problems/maximum-depth-of-binary-tree/代码# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = Non...

题目链接：https://leetcode.com/problems/gray-code/submissions/代码class Solution: def grayCode(self, n: int) -> List[int]: return [ i^i>>1 for i in range(1<<n)]思路详解格雷编码：在一组数的编...

题目链接：https://leetcode.com/problems/climbing-stairs/submissions/动态规划法代码class Solution: def climbStairs(self, n: int) -> int: #入参判断 if not n or n ==1 : return 1 #初始赋值 ...

题目链接：https://leetcode.com/problems/sort-list/归并排序法代码# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solu...

题目链接：https://leetcode.com/problems/kth-largest-element-in-an-array/submissions/代码class Solution: def findKthLargest(self, nums: List[int], k: int) -> int: """ :type nums: List...

题目链接：https://leetcode.com/problems/contains-duplicate/submissions/代码class Solution: def containsDuplicate(self, nums: List[int]) -> bool: if not nums:return False frequen=set(...

题目链接：https://leetcode.com/problems/reverse-string/代码class Solution: def reverseString(self, s: List[str]) -> None: """ Do not return anything, modify s in-place instead. ...

题目链接：https://leetcode.com/problems/nim-game/代码class Solution: def canWinNim(self, n: int) -> bool: return n%4!=0

题目链接：https://leetcode.com/problems/product-of-array-except-self/代码class Solution: def productExceptSelf(self, nums: List[int]) -> List[int]: n=len(nums) dp1,dp2=[1]*n,[1]*n ...

题目链接：https://leetcode.com/problems/delete-node-in-a-linked-list/代码# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Non...

题目链接：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/代码# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self...

题目链接：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/代码# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# ...

题目链接：https://leetcode.com/problems/power-of-two/代码class Solution: def isPowerOfTwo(self, n: int) -> bool: if n==0:return False return not n&(n-1)解题思路2n2^n2n在二进制上只有一位是1，...

题目链接：https://leetcode.com/problems/kth-smallest-element-in-a-bst/代码# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = No...

题目链接：https://leetcode.com/problems/single-number/代码class Solution: def singleNumber(self, nums: List[int]) -> int: for i in range(1,len(nums)): nums[0]^=nums[i] re...

题目链接：https://leetcode.com/problems/binary-tree-maximum-path-sum/代码# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = Non...

题目链接：https://leetcode.com/problems/lru-cache/代码class LRUCache(object): def __init__(self, capacity): """ :type capacity: int """ self.capacity=capacity s...

题目链接：https://leetcode.com/problems/unique-paths/自己的思路代码class Solution: def uniquePaths(self, m, n) -> int: while not m or not n : return 0 dp = [[0 for col in range(n)] for r...

题目链接：https://leetcode.com/problems/spiral-matrix/代码class Solution: def spiralOrder(self, matrix: List[List[int]]) -> List[int]: return matrix and [*matrix.pop(0)] + self.spiralOrder([...

题目链接：https://leetcode.com/problems/merge-k-sorted-lists/代码# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass...

题目链接：https://leetcode.com/problems/merge-two-sorted-lists/代码# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Nonecla...

题目链接：https://leetcode.com/problems/valid-parentheses/方法一 栈的方式代码class Solution: def isValid(self, s: str) -> bool: if not s or s==[] : return True if len(s)&1 :return Fals...

题目链接：https://leetcode.com/problems/longest-palindromic-substring/代码：class Solution: def longestPalindrome(self, s: str) -> str: def helper(i, j): while i >=0 and j...

题目链接：https://leetcode.com/problems/remove-duplicates-from-sorted-array/代码class Solution: def removeDuplicates(self, nums: List[int]) -> int: if len(nums) == 0: return 0 ...

题目链接：https://leetcode.com/problems/median-of-two-sorted-arrays/代码class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: #思路：有序扔除一些数，直到扔出一半 ...

题目链接：https://leetcode.com/problems/add-two-numbers/代码# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solu...

题目链接：https://leetcode.com/problems/palindrome-number/代码全部反转后对比class Solution: def isPalindrome(self, x: int) -> bool: if x<0: return False else: ...

题目链接：https://leetcode.com/problems/3sum-closest/代码class Solution: def threeSumClosest(self, nums, target) -> int: l=len(nums) nums.sort() res=float('inf') for ...

题目链接：https://leetcode.com/problems/3sum/代码class Solution: def threeSum(self, nums: List[int]) -> List[List[int]]: count={} #统计出现的次数，放入dict里面，其中key为值，value为次数 for num i...

题目链接：https://leetcode.com/problems/container-with-most-water/代码class Solution: def maxArea(self, height: List[int]) -> int: max_area,l=0,len(height) left,right=0,l-1 w...

题目链接：https://leetcode.com/problems/reverse-integer/思路一：作为值处理代码class Solution: def reverse(self, x: int) -> int: res,x_abs=0,abs(x) while x_abs: res,x_abs=res*10+x...

题目链接：https://leetcode.com/problems/maximum-subarray/代码class Solution: def maxSubArray(self, nums: List[int]) -> int: # 为空的时候，不懂得为啥这么设置 if not nums: return -2147483648 ...

题目链接：https://leetcode.com/problems/rotate-list/自己的思路代码# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass So...