LeetCode之分治
黄焖鸡米饭啊
嗯。
展开
-
Pow(x, n)
题目描述: Implement pow(x, n). 在进行该题目之前要先了解斐波那契数列的递归解法。 public class exercise { public static int Fibonacci(int n) { if(n<=1) return n; else return Fibonacci(n-1)+Fibonacci(n-2); } publi原创 2017-08-07 20:34:04 · 398 阅读 · 0 评论 -
Merge_k_Sorted_Lists
题目描述:Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.(合并k个有序链表).思路:普通思路就是把每条链表单拿出来遍历,然后将链表中的元素一个一个往结果集中按大小放,直到所有链表都被遍历完。如果有n条链表,每个list的最大长度是m,假如使用,时间复...原创 2017-12-29 21:10:38 · 178 阅读 · 0 评论 -
Kth Largest Element in an Array
题目描述:Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.Example 1:Input: [3,2,1,5,6,4] and k = 2Output: 5Examp...原创 2018-06-24 17:47:35 · 107 阅读 · 0 评论 -
Unique Binary Search Trees II
题目3:Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n.Example:Input: 3Output:[ [1,null,3,2], [3,2,null,1], [3,1,null,null,2], [2,1,3], [1,...原创 2018-06-26 21:09:54 · 232 阅读 · 0 评论 -
Different Ways to Add Parentheses
题目描述:Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.Example 1:In...原创 2018-06-26 21:18:02 · 136 阅读 · 0 评论