Chas_Liu-CSDN博客

原创 DataWhale:leetcode Day50

一、leetcode地址https://leetcode.com/problems/median-of-two-sorted-arrays/二、问题描述三、代码实现语言：Python3代码：class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> flo...

2019-06-28 09:02:54 111

原创 DataWhale:leetcode Day49

一、leetcode地址https://leetcode.com/problems/lru-cache/二、问题描述三、代码实现语言：Python3代码：class ListNode: def __init__(self,key=None,value=None): self.key = key self.val = value ...

2019-06-27 09:03:32 240

原创 DataWhale:leetcode Day48

一、leetcode地址https://leetcode.com/problems/search-in-rotated-sorted-array/二、问题描述三、代码实现语言：Python3代码：class Solution: def search(self, nums: List[int], target: int) -> int: if not nu...

2019-06-26 09:09:20 122

原创 DataWhale:leetcode Day47

一、leetcode地址https://leetcode.com/problems/3sum-closest/二、问题描述三、代码实现语言：Python3代码：class Solution: def threeSumClosest(self, nums: List[int], target: int) -> int: nums.sort() ...

2019-06-25 12:11:48 161

原创 DataWhale:leetcode Day46

一、leetcode地址https://leetcode.com/problems/3sum/二、问题描述三、代码实现语言：Python3代码：class Solution: def threeSum(self, nums: List[int]) -> List[List[int]]: nums.sort() print(f'nums:{...

2019-06-24 09:01:43 109

原创 DataWhale:leetcode Day45

一、leetcode地址https://leetcode.com/problems/binary-tree-maximum-path-sum/二、问题描述三、代码实现语言：Python3代码：class Solution: def maxPathSum(self, root: TreeNode) -> int: max_ = float('-inf')...

2019-06-23 10:29:40 132

原创 DataWhale:leetcode Day44

一、leetcode地址https://leetcode.com/problems/longest-palindromic-substring/二、问题描述三、代码实现语言：Python3代码：class Solution: def longestPalindrome(self, s: str) -> str: len_ = len(s) ...

2019-06-22 13:07:35 180

原创 DataWhale:leetcode Day43

一、leetcode地址https://leetcode.com/problems/multiply-strings/二、问题描述三、代码实现语言：Python3代码：class Solution: def multiply(self, num1: str, num2: str) -> str: if num1 == '0' or num2 == '0'...

2019-06-21 10:04:00 183

原创 DataWhale:leetcode Day42

一、leetcode地址https://leetcode.com/problems/kth-largest-element-in-an-array/二、问题描述在这里插入图片描述三、代码实现语言：Python3代码：class Solution: def findKthLargest(self, nums: List[int], k: int) -> int: ...

2019-06-20 08:47:32 117

原创 DataWhale:leetcode Day41

一、leetcode地址https://leetcode.com/problems/linked-list-cycle-ii/二、问题描述三、代码实现语言：Python3代码：class Solution(object): def detectCycle(self, head): """ :type head: ListNode ...

2019-06-19 11:06:27 117

原创 DataWhale:leetcode Day40

一、leetcode地址https://leetcode.com/problems/string-to-integer-atoi/二、问题描述三、代码实现语言：Python3代码：class Solution: def myAtoi(self, str: str) -> int: length = len(str);i = 0;res = 0;token...

2019-06-18 14:37:34 127

原创 DataWhale:leetcode Day39

一、leetcode地址https://leetcode.com/problems/maximum-subarray/二、问题描述三、代码实现语言：Python3代码：class Solution: def maxSubArray(self, nums: List[int]) -> int: temp = nums[0];total = nums[0]...

2019-06-17 10:38:06 98

原创 DataWhale:leetcode Day38

一、leetcode地址https://leetcode.com/problems/majority-element/二、问题描述三、代码实现语言：Python3代码：class Solution: def majorityElement(self, nums: List[int]) -> int: stack = [] for num ...

2019-06-16 20:25:32 92

原创 DataWhale:leetcode Day37

一、leetcode地址https://leetcode.com/problems/sort-list/二、问题描述三、代码实现语言：Python3代码：class Solution: def sortList(self, head: ListNode) -> ListNode: if not head or not head.next: ...

2019-06-15 21:11:53 129

原创 DataWhale:leetcode Day36

一、leetcode地址https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/二、问题描述三、代码实现语言：Python3代码：class Solution: def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q:...

2019-06-14 13:30:03 96

原创 DataWhale:leetcode Day35

一、leetcode地址https://leetcode.com/problems/gray-code/二、问题描述三、代码实现语言：Python3代码：class Solution: def grayCode(self, n: int) -> List[int]: if n == 0: l1 = [0] else...

2019-06-13 11:43:20 109

原创 DataWhale:leetcode Day34

一、leetcode地址https://leetcode.com/problems/intersection-of-two-linked-lists/二、问题描述三、代码实现语言：Python3代码：class Solution(object): def getIntersectionNode(self, headA, headB): tempA = head...

2019-06-13 09:01:00 112

原创 DataWhale:leetcode Day33

一、leetcode地址https://leetcode.com/problems/merge-k-sorted-lists/二、问题描述三、代码实现语言：Python3代码：class Solution: def mergeKLists(self, lists: List[ListNode]) -> ListNode: l = len(lists) ...

2019-06-11 14:33:52 97

原创 DataWhale:leetcode Day32

一、leetcode地址https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/二、问题描述三、代码实现语言：Python3代码：class Solution: def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNo...

2019-06-10 09:46:33 83

原创 DataWhale:leetcode Day31

一、leetcode地址https://leetcode.com/problems/reverse-string/二、问题描述三、代码实现语言：Python3代码：class Solution: def reverseString(self, s: List[str]) -> None: """ Do not return anythin...

2019-06-07 11:54:45 151

原创 DataWhale:leetcode Day30

一、leetcode地址https://leetcode.com/problems/reverse-words-in-a-string-iii/二、问题描述三、代码实现语言：Python3代码：class Solution: def reverseWords(self, s: str) -> str: temp = [];s1 = '' ...

2019-06-07 11:54:16 166

原创 DataWhale:leetcode Day29

一、leetcode地址https://leetcode.com/problems/kth-smallest-element-in-a-bst/二、问题描述三、代码实现语言：Python3代码：class Solution: def ldr(self,root): if root: return self.ldr(root.left)+...

2019-06-07 11:52:44 48

原创 DataWhale:leetcode Day28

一、leetcode地址https://leetcode.com/problems/single-number/二、问题描述三、代码实现语言：Python3代码：class Solution: def singleNumber(self, nums: List[int]) -> int: ans = 0 for num in nums:...

2019-06-06 09:12:24 73

原创 DataWhale:leetcode Day27

一、leetcode地址https://leetcode.com/problems/linked-list-cycle/二、问题描述三、代码实现语言：Python3代码：class Solution(object): def hasCycle(self, head): """ :type head: ListNode :rtyp...

2019-06-05 09:32:50 76

原创 DataWhale:leetcode Day26

一、leetcode地址https://leetcode.com/problems/merge-sorted-array/二、问题描述三、代码实现语言：Python3代码：class Solution: def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None: ...

2019-06-04 11:17:05 78

原创 DataWhale:leetcode Day25

一、leetcode地址https://leetcode.com/problems/palindrome-number/二、问题描述三、代码实现语言：Python3代码：class Solution: def isPalindrome(self, x: int) -> bool: s = str(x) for i in range(len...

2019-06-03 14:17:28 72

原创 DataWhale:leetcode Day24

一、leetcode地址https://leetcode.com/problems/unique-paths/二、问题描述三、代码实现语言：Python3代码：class Solution: def uniquePaths(self, m: int, n: int) -> int: if m == 1 or n == 1: ret...

2019-06-02 22:10:01 85

原创 DataWhale:leetcode Day23

一、leetcode地址https://leetcode.com/problems/subsets/二、问题描述三、代码实现语言：Python3代码：class Solution: def subsets(self, nums: List[int]) -> List[List[int]]: n = len(nums);l2 = [] fo...

2019-06-01 22:56:49 72

原创 DataWhale:leetcode Day22

一、leetcode地址https://leetcode.com/problems/min-stack/二、问题描述三、代码实现语言：Python3代码：class MinStack: def __init__(self): """ initialize your data structure here. """ se...

2019-05-31 17:13:18 109

原创 DataWhale:leetcode Day21

一、leetcode地址https://leetcode.com/problems/spiral-matrix-ii/二、问题描述三、代码实现语言：Python3代码：class Solution: def generateMatrix(self, n: int) -> List[List[int]]: l2 = [[0]*n for i in rang...

2019-05-30 16:07:32 84

原创 DataWhale:leetcode Day20

一、leetcode地址https://leetcode.com/problems/contains-duplicate/二、问题描述三、代码实现语言：Python3代码：class Solution: def containsDuplicate(self, nums: List[int]) -> bool: return len(nums) != le...

2019-05-29 09:15:15 63

原创 DataWhale:leetcode Day19

一、leetcode地址https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/二、问题描述三、代码实现语言：Python3代码：class Solution: def maxProfit(self, prices: List[int]) -> int: profit = 0 ...

2019-05-28 09:36:33 795

原创 DataWhale:leetcode Day18

一、leetcode地址https://leetcode.com/problems/product-of-array-except-self/二、问题描述三、代码实现语言：Python3代码：class Solution: def productExceptSelf(self, nums: List[int]) -> List[int]: n = len...

2019-05-27 11:04:08 128

原创 DataWhale:leetcode Day17

一、leetcode地址https://leetcode.com/problems/nim-game/二、问题描述三、代码实现语言：Python3代码：class Solution: def canWinNim(self, n: int) -> bool: if n % 4 == 0: return False e...

2019-05-26 18:53:49 95

原创 DataWhale:leetcode Day16

一、leetcode地址https://leetcode.com/problems/climbing-stairs/二、问题描述三、代码实现语言：Python3代码：class Solution: def climbStairs(self, n: int) -> int: if n == 1: return 1 e...

2019-05-25 22:47:06 107

原创 DataWhale:leetcode Day15

一、leetcode地址https://leetcode.com/problems/best-time-to-buy-and-sell-stock/二、问题描述三、代码实现语言：Python3代码：class Solution: def maxProfit(self, prices: List[int]) -> int: if prices: ...

2019-05-24 10:17:42 76

原创 DataWhale:leetcode Day14

一、leetcode地址https://leetcode.com/problems/maximum-depth-of-binary-tree/二、问题描述三、代码实现语言：Python3代码：class Solution: def maxDepth(self, root: TreeNode) -> int: if root == None: ...

2019-05-22 18:52:07 119

原创 DataWhale:leetcode Day13

一、leetcode地址https://leetcode.com/problems/container-with-most-water/二、问题描述三、代码实现语言：Python3代码：class Solution: def maxArea(self, height: List[int]) -> int: i = 0;j = len(height)-1...

2019-05-22 18:51:57 241

原创 DataWhale:leetcode Day12

一、leetcode地址https://leetcode.com/problems/merge-two-sorted-lists/二、问题描述三、代码实现语言：Python3代码：class Solution: def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode: while l...

2019-05-21 08:41:35 86

原创 DataWhale:leetcode Day11

一、leetcode地址https://leetcode.com/problems/remove-duplicates-from-sorted-array/二、问题描述三、代码实现语言：Python3代码：class Solution: def removeDuplicates(self, nums: List[int]) -> int: i = 0 ...

2019-05-20 09:05:03 109

空空如也

空空如也