递归
文章平均质量分 76
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 156. Binary Tree Upside Down(树的倒转)
原题网址:https://leetcode.com/problems/binary-tree-upside-down/Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or em原创 2016-05-26 00:48:19 · 871 阅读 · 0 评论 -
LeetCode 87. Scramble String(字符串扰乱)
原题网址:https://leetcode.com/problems/scramble-string/Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible原创 2016-05-23 00:34:32 · 1661 阅读 · 0 评论 -
LeetCode 365. Water and Jug Problem
原题网址:https://leetcode.com/problems/water-and-jug-problem/You are given two jugs with capacities x and y litres. There is an infinite amount of water supply available. You need to determine wheth原创 2016-06-25 05:28:10 · 1615 阅读 · 0 评论 -
最大半径问题
一个长度为n的数组,从中选取k个数字,若定义这k个数字的半径为排序后相邻两个数字之间的最小间隔,则k个数字所能达到的最大半径是多少?如果k = 1,则半径为无穷大。假设k > 0。方法一:深度优先搜索。class SolutionDFS { private int max = 0; public SolutionDFS(int[] nums, int k) { find(n原创 2016-06-25 03:09:28 · 670 阅读 · 0 评论 -
LeetCode 60. Permutation Sequence(排列序列)
原题网址:https://leetcode.com/problems/permutation-sequence/The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the原创 2016-05-21 09:05:38 · 788 阅读 · 0 评论 -
LeetCode 54. Spiral Matrix(螺旋矩阵)
原题网址:https://leetcode.com/problems/spiral-matrix/Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following mat原创 2016-05-21 06:56:42 · 663 阅读 · 0 评论 -
LeetCode 50. Pow(x, n)(求幂)
原题网址:https://leetcode.com/problems/powx-n/Implement pow(x, n).方法一:倍乘,迭代。public class Solution { public double myPow(double x, int n) { long ln = (long)n; if (ln < 0) {原创 2016-05-21 06:17:41 · 557 阅读 · 0 评论 -
LeetCode 4. Median of Two Sorted Arrays(两个有序数组的中位数)
原题网址:https://leetcode.com/problems/median-of-two-sorted-arrays/There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run t原创 2016-05-01 15:39:34 · 961 阅读 · 0 评论 -
LeetCode 364. Nested List Weight Sum II
原题网址:https://leetcode.com/problems/nested-list-weight-sum-ii/Given a nested list of integers, return the sum of all integers in the list weighted by their depth.Each element is either an int原创 2016-06-24 00:16:31 · 2757 阅读 · 0 评论 -
LeetCode 250. Count Univalue Subtrees(单值子树)
原题网址:https://leetcode.com/problems/count-univalue-subtrees/Given a binary tree, count the number of uni-value subtrees.A Uni-value subtree means all nodes of the subtree have the same value.原创 2016-04-07 13:49:39 · 1846 阅读 · 0 评论 -
LeetCode 337. House Robber III(小偷游戏)
原题网址:https://leetcode.com/problems/house-robber-iii/The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root,原创 2016-04-30 06:12:14 · 999 阅读 · 0 评论 -
LeetCode 95. Unique Binary Search Trees II(唯一二叉搜索树)
原题网址:https://leetcode.com/problems/unique-binary-search-trees-ii/Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your原创 2016-05-23 00:35:30 · 488 阅读 · 0 评论 -
LeetCode 96. Unique Binary Search Trees(唯一二叉树)
原题网址:https://leetcode.com/problems/unique-binary-search-trees/Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a原创 2016-05-23 00:38:28 · 385 阅读 · 0 评论 -
LeetCode 97. Interleaving String(字符串交织)
原题网址:https://leetcode.com/problems/interleaving-string/Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When原创 2016-05-23 00:39:00 · 946 阅读 · 0 评论 -
LeetCode 115. Distinct Subsequences(子序列数量)
原题网址:https://leetcode.com/problems/distinct-subsequences/Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which原创 2016-05-24 00:19:33 · 512 阅读 · 0 评论 -
LeetCode 72. Edit Distance(编辑距离)
原题网址:https://leetcode.com/problems/edit-distance/Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)Y原创 2016-05-22 05:18:34 · 666 阅读 · 0 评论 -
LeetCode 130. Surrounded Regions(包围区域)
原题网址:https://leetcode.com/problems/surrounded-regions/Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's i原创 2016-05-27 00:25:49 · 517 阅读 · 0 评论 -
LeetCode 372. Super Pow
原题网址:https://leetcode.com/problems/super-pow/Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.Exam原创 2016-07-14 01:42:28 · 1016 阅读 · 0 评论 -
LeetCode 332. Reconstruct Itinerary(重构行程)
原题网址:https://leetcode.com/problems/reconstruct-itinerary/Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order.原创 2016-04-29 08:06:51 · 1617 阅读 · 0 评论 -
LeetCode 94. Binary Tree Inorder Traversal(二叉树的中序遍历)
原题网址:https://leetcode.com/problems/binary-tree-inorder-traversal/Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1原创 2016-05-23 00:35:01 · 1002 阅读 · 0 评论 -
LeetCode 145. Binary Tree Postorder Traversal(二叉树后序遍历)
原题网址:https://leetcode.com/problems/binary-tree-postorder-traversal/Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1原创 2016-05-26 01:31:28 · 518 阅读 · 0 评论 -
LeetCode 101. Symmetric Tree(对称的树)
原题网址:https://leetcode.com/problems/symmetric-tree/Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric:原创 2016-05-23 03:22:34 · 705 阅读 · 0 评论 -
LeetCode 100. Same Tree(相同的树)
原题网址:https://leetcode.com/problems/same-tree/Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identic原创 2016-05-23 00:49:13 · 405 阅读 · 0 评论 -
LeetCode 98. Validate Binary Search Tree(校验二叉搜索树)
原题网址:https://leetcode.com/problems/validate-binary-search-tree/Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtre原创 2016-05-23 00:39:15 · 492 阅读 · 0 评论 -
LeetCode 333. Largest BST Subtree(最大二叉搜索树)
原题网址:https://leetcode.com/problems/largest-bst-subtree/Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of nodes原创 2016-04-29 13:22:12 · 2206 阅读 · 0 评论 -
LeetCode 206. Reverse Linked List(翻转链表)
原题网址:https://leetcode.com/problems/reverse-linked-list/Reverse a singly linked list.click to show more hints.Hint:A linked list can be reversed either iteratively or recursively. Could原创 2016-05-04 08:22:21 · 652 阅读 · 0 评论 -
LeetCode 126. Word Ladder II(单词梯子)
原题网址:https://leetcode.com/problems/word-ladder-ii/Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, s原创 2016-05-27 00:26:42 · 881 阅读 · 0 评论 -
LeetCode 116. Populating Next Right Pointers in Each Node(右邻)
原题网址:https://leetcode.com/problems/populating-next-right-pointers-in-each-node/Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkN原创 2016-05-24 00:19:38 · 342 阅读 · 0 评论 -
LeetCode 114. Flatten Binary Tree to Linked List(摊平二叉树)
原题网址:https://leetcode.com/problems/flatten-binary-tree-to-linked-list/Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5原创 2016-05-24 00:19:26 · 504 阅读 · 0 评论 -
LeetCode 112. Path Sum(路径和)
原题网址:https://leetcode.com/problems/path-sum/Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.原创 2016-05-24 00:18:59 · 475 阅读 · 0 评论 -
LeetCode 111. Minimum Depth of Binary Tree(二叉树最小深度)
原题网址:https://leetcode.com/problems/minimum-depth-of-binary-tree/Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root nod原创 2016-05-24 00:18:53 · 994 阅读 · 0 评论 -
LeetCode 110. Balanced Binary Tree(平衡二叉树)
原题网址:https://leetcode.com/problems/balanced-binary-tree/Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in原创 2016-05-24 00:12:55 · 540 阅读 · 0 评论 -
LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal(根据中序遍历和后序遍历构造二叉树)
原题网址:https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume原创 2016-05-24 00:12:37 · 447 阅读 · 0 评论 -
LeetCode 104. Maximum Depth of Binary Tree(二叉树高度)
原题网址:https://leetcode.com/problems/maximum-depth-of-binary-tree/Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node原创 2016-05-24 00:12:30 · 518 阅读 · 0 评论 -
LeetCode 329. Longest Increasing Path in a Matrix(矩阵内的最长递增路径)
原题网址:https://leetcode.com/problems/longest-increasing-path-in-a-matrix/Given an integer matrix, find the length of the longest increasing path.From each cell, you can either move to four dir原创 2016-04-28 01:57:37 · 1635 阅读 · 0 评论 -
LeetCode 286. Walls and Gates(墙与门)
原题网址:https://leetcode.com/problems/walls-and-gates/You are given a m x n 2D grid initialized with these three possible values.-1 - A wall or an obstacle.0 - A gate.INF - Infinity means an em原创 2016-04-15 01:10:25 · 1198 阅读 · 0 评论 -
LeetCode 222. Count Complete Tree Nodes(完全二叉树节点数统计)
本人原创,如有错误恳请指正,谢谢!原题网址https://leetcode.com/problems/count-complete-tree-nodes/Given a complete binary tree, count the number of nodes.原创 2016-04-04 13:01:11 · 4283 阅读 · 3 评论 -
LeetCode 255. Verify Preorder Sequence in Binary Search Tree(检查二叉搜索树的前序遍历)
原题网址:https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/Given an array of numbers, verify whether it is the correct preorder traversal sequence of a binary search tree.原创 2016-04-09 04:44:06 · 981 阅读 · 0 评论 -
LeetCode 258. Add Digits(数位相加)
原题网址:https://leetcode.com/problems/add-digits/Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the proces原创 2016-04-09 05:47:27 · 1558 阅读 · 0 评论 -
LeetCode 270. Closest Binary Search Tree Value(二叉搜索树最接近值查找)
原题网址:https://leetcode.com/problems/closest-binary-search-tree-value/Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.Note:原创 2016-04-13 02:53:19 · 3005 阅读 · 0 评论