- 博客(11)
- 收藏
- 关注
RSS订阅原创 菜鸡刷leetcode 剑指 Offer 10- II. 青蛙跳台阶问题
class Solution: def numWays(self, n: int) -> int: if n == 1 or n == 0: return 1 if n == 2: return 2 ways = self.numWays(n-1) + self.numWays(n-2) return ways 第一步要么跳1个，要么跳2个，剩下的台阶也是一样，按这个方法递归。
2021-04-01 22:41:14
86
原创 菜鸡刷leetcode 剑指 Offer 17. 打印从1到最大的n位数
class Solution: def printNumbers(self, n: int) -> List[int]: nums = [i for i in range(1,pow(10,n))] return nums 注意： 列表生成式 nums = [i for i in range(1,pow(10,n))] 算平方 pow(10,n)
2021-04-01 22:39:22
43
原创 菜鸡刷leetcode 剑指 Offer 22. 链表中倒数第k个节点
搞两个指针，前面的和后面的隔k-1个，一起出发遍历，等前面的到最后一个节点时，后面的就是倒数第k个 # Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def getKthFromEnd(self, head: ListNode, k: int) -&g
2021-04-01 22:14:44
133
原创 菜鸡刷leetcode 剑指 Offer 55 - I. 二叉树的深度
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def maxDepth(self, root: TreeNode) -> int: if root == None:
2021-04-01 21:50:23
83
原创 菜鸡刷leetcode 剑指 Offer 27. 二叉树的镜像
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def mirrorTree(self, root: TreeNode) -> TreeNode: p = root
2021-04-01 20:58:27
58
原创 菜鸡刷leetcode 剑指 Offer 18. 删除链表的节点
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def deleteNode(self, head: ListNode, val: int) -> ListNode: p = head while p.next !
2021-04-01 20:55:46
58
原创 菜鸡刷leetcode 剑指 Offer 05. 替换空格
我的原始做法： class Solution: def replaceSpace(self, s: str) -> str: newlist = [] for item in s: if item == ' ': newlist.append("%20") else: newlist.append(item) return ''.joi
2021-04-01 20:17:22
60
原创 菜鸡刷leetcode 剑指 Offer 04. 二维数组中的查找
class Solution: def findNumberIn2DArray(self, matrix: List[List[int]], target: int) -> bool: n = len(matrix) if n == 0: return False m = len(matrix[0]) if m == 0: return False row =
2021-04-01 19:23:17
72
原创 菜鸡刷leetcode 912.排序数组——每天亿遍，把快排刻在DNA里
每天亿遍，把快排刻在DNA里 class Solution: def sortArray(self, nums: List[int]) -> List[int]: n = len(nums) def sort(left,right): if left >= right: return nums pivot = left i = left
2021-04-01 15:36:25
85
原创 菜鸡刷leetcode 剑指 Offer 03. 数组中重复的数字
剑指 Offer 03. 数组中重复的数字 class Solution: def findRepeatNumber(self, nums: List[int]) -> int: n = len(nums) dic = dict() for i in nums: if i in dic: return i else: dic[i]=1
2021-04-01 15:18:50
99
原创 菜鸡刷leetcode 169. 多数元素
1. 字典 class Solution: def majorityElement(self, nums: List[int]) -> int: n = len(nums) dic1 = dict() dic2 = dict() count = 0 for item in nums: dic1[item] = 0 for item in nums:
2021-03-08 02:58:04
207
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人