玩命加载中 . . .

学习之旅
100/101-对称二叉树 100/101-对称二叉树
LeetCode 100. Same TreeLeetCode-100 Given the roots of two binary trees p and q, write a function to check if they are t
2021-07-04
226-翻转二叉树 226-翻转二叉树
LeetCode 226. Invert Binary TreeLeetCode-226 Given the root of a binary tree, invert the tree, and return its root. Exam
2021-07-03
332-重新安排行程 332-重新安排行程
LeetCode 332. Reconstruct ItineraryLeetCode-332 You are given a list of airline tickets where tickets[i] = [from, to] re
2021-06-27
169-多数元素 169-多数元素
LeetCode 169. Majority ElementLeetCode-169 Given an array nums of size n, return the majority element. The majority elem
2021-06-27
102-二叉树的层序遍历 102-二叉树的层序遍历
LeetCode 102. Binary Tree Level Order TraversalLeetCode-102 Given the root of a binary tree, return the level order trav
2021-06-26
46/47-全排列 46/47-全排列
LeetCode 46. PermutationsLeetCode-46 Given an array nums of distinct integers, return all the possible permutations. You
2021-06-26
491-递增子序列 491-递增子序列
LeetCode 491. Increasing SubsequencesLeetCode-491 Given an integer array nums, return all the different possible increas
2021-06-26
78/90-子集 78/90-子集
LeetCode 78. SubsetsLeetCode-78 Given an integer array nums of unique elements, return all possible subsets (the power s
2021-06-26
93-复原IP地址 93-复原IP地址
LeetCode 93. Restore IP AddressesLeetCode-93 Given a string s containing only digits, return all possible valid IP addre
2021-06-25
94/144/145-二叉树的遍历 94/144/145-二叉树的遍历
LeetCode 94. Binary Tree Inorder TraversalLeetCode-94 Given the root of a binary tree, return the inorder traversal of i
2021-06-24
131-分割回文串 131-分割回文串
LeetCode 131. Palindrome PartitioningLeetCode-131 Given a string s, partition s such that every substring of the partiti
2021-06-24
39/40/216-组合总和 39/40/216-组合总和
LeetCode 39. Combination SumLeetCode-39 Given an array of distinct integers candidates and a target integer target, retu
2021-06-23
32 / 43