lian740930980的博客

题目链接：752. 打开转盘锁

题目链接：704. 二分查找二分搜索简介 + Leetcode刷题 704. 二分查找 Binary Searchclass Solution: def search(self, nums: List[int], target: int) -> int: # def search(self, nums: List[int], target: int) -> int: # # 普通二分查找法 # left = 0 # r

【详解Leetcode_206】反转链表 Reverse Linked List题目链接：206. 反转链表class Solution: def reverseList(self, head): #head = [1,2,3],1->2->3->null pre = None; cur = head;next = None while cur != None: nxt = cur.next

# 法一：暴力枚举class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: n = len(nums) for i in range(n): for j in range(i + 1, n): if nums[i] + nums[j] == target: retu...

leetcode 141. 环形链表# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def hasCycle(self, head: ListNode) -> bool: if not head or not he

剑指 Offer 55 - I. 二叉树的深度题目链接class Solution: def maxDepth(self, root: TreeNode) -> int: if not root: return 0 return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1

DFS和BFS的视频讲解一、BFS队列：先进先出字典基础操作，代码中用到的语法用BFS找两点之间的路径二、DFS栈：后进先出三、最短路径输出结果代码中用到的语法：优先队列...

N皇后讲解class Solution: def solveNQueens(self, n: int) -> List[List[str]]: ans = [] board = [["." for i in range(n)] for j in range(n)] #棋盘 def backtrack(board, row): if row == n: ans.append(['.