James Pan

原题网址：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

原题网址：https://leetcode.com/problems/pascals-triangle/ Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1],

原题网址：https://leetcode.com/problems/pascals-triangle-ii/ Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize

原题网址：https://leetcode.com/problems/binary-tree-preorder-traversal/ Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1

一个长度为n的数组，从中选取k个数字，若定义这k个数字的半径为排序后相邻两个数字之间的最小间隔，则k个数字所能达到的最大半径是多少？ 如果k = 1，则半径为无穷大。 假设k > 0。 方法一：深度优先搜索。 class SolutionDFS { private int max = 0; public SolutionDFS(int[] nums, int k) { find(n

原题网址：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

原题网址：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

原题网址：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