leetcode
_海阔天空
这个作者很懒,什么都没留下…
展开
-
CODE 34: Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is pretty straight forward. Could you devise a原创 2013-09-20 19:33:34 · 827 阅读 · 0 评论 -
CODE 26: Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree {3,9,20,#,#,15,7},原创 2013-09-20 19:38:56 · 683 阅读 · 0 评论 -
CODE 35: 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 subtree of a node contains only nodes with keys less than the node's key.Th原创 2013-09-20 21:39:24 · 636 阅读 · 0 评论 -
CODE 36: 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 s3 = "aadbbcbcac", return true.When s3 = "aadbbbaccc", ret原创 2013-09-20 23:36:14 · 593 阅读 · 0 评论 -
CODE 38: 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 total of 5 unique BST's. 1 3 3 2 1 \原创 2013-09-21 10:40:34 · 538 阅读 · 0 评论 -
CODE 37: 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 program should return all 5 unique BST's shown below. 1 3原创 2013-09-21 11:01:06 · 623 阅读 · 0 评论 -
CODE 46: 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 representation of s1 = "great": great / \ gr原创 2013-09-21 19:51:04 · 697 阅读 · 0 评论 -
CODE 39: Submission Details
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solutio原创 2013-09-21 20:00:05 · 543 阅读 · 0 评论 -
CODE 61: Simplify Path
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cases:Did原创 2013-10-06 16:23:58 · 543 阅读 · 0 评论 -
CODE 64: Text Justification
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.You should pack your words in a greedy approach; that i原创 2013-10-07 11:37:23 · 538 阅读 · 0 评论 -
CODE 40: Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order原创 2013-09-21 21:09:27 · 537 阅读 · 0 评论 -
CODE 62: Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? public int climbStairs(in原创 2013-10-06 17:05:50 · 585 阅读 · 0 评论 -
CODE 63: Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x. public int sqrt(int x) { // Note: The Solution object is instantiated only once and is reused by // each test case. i原创 2013-10-06 17:19:33 · 481 阅读 · 0 评论 -
CODE 65: Plus One
Given a number represented as an array of digits, plus one to the number. public int[] plusOne(int[] digits) { // Start typing your Java solution below // DO NOT write main() function int c原创 2013-10-07 15:37:17 · 657 阅读 · 0 评论 -
CODE 67: Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100". public String addBinary(String a, String b) { // Note: The Solution object原创 2013-10-07 19:59:34 · 599 阅读 · 0 评论 -
CODE 69: Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at原创 2013-10-07 22:13:22 · 554 阅读 · 0 评论 -
CODE 71: Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the原创 2013-10-07 22:36:05 · 573 阅读 · 0 评论 -
CODE 70: Unique Paths II
Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the原创 2013-10-07 23:22:17 · 1100 阅读 · 0 评论 -
CODE 66: Valid Number
Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguous.原创 2013-10-07 19:34:22 · 1075 阅读 · 0 评论 -
CODE 68: Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. public ListNode mergeTwoLists(ListNode l1, ListNode原创 2013-10-07 20:07:42 · 508 阅读 · 0 评论 -
CODE 43: Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total nu原创 2013-09-22 21:55:13 · 506 阅读 · 0 评论 -
CODE 44: Gray Code
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of原创 2013-09-22 22:52:19 · 524 阅读 · 0 评论 -
CODE 72: Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL. public ListNode rotateRight(Li原创 2013-10-09 00:06:37 · 482 阅读 · 0 评论 -
CODE 45: Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space to hold additional elements from B. The number of elements initialized in A原创 2013-09-23 22:43:47 · 411 阅读 · 0 评论 -
CODE 73: 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 following sequence (ie, for n = 3):"123""132""213""231""3原创 2013-10-09 19:41:45 · 565 阅读 · 0 评论 -
CODE 75: Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is原创 2013-10-10 21:32:13 · 480 阅读 · 0 评论 -
CODE 77: Merge Intervals
Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18]. public ArrayList merge(ArrayList intervals) {原创 2013-10-10 23:20:18 · 497 阅读 · 0 评论 -
CODE 47: Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of原创 2013-09-25 22:30:06 · 697 阅读 · 0 评论 -
CODE 76: Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.E原创 2013-10-11 20:22:05 · 457 阅读 · 0 评论 -
CODE 78: Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine i原创 2013-10-11 21:53:04 · 474 阅读 · 0 评论 -
CODE 79: 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 matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]原创 2013-10-12 23:11:27 · 534 阅读 · 0 评论 -
CODE 80: Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−1,2,1] ha原创 2013-10-13 22:07:19 · 483 阅读 · 0 评论 -
CODE 49:Largest Rectangle in Histogram
public int largestRectangleArea(int[] height) { // Start typing your Java solution below // DO NOT write main() function if (null == height || height.length <= 0) { return 0; } int max =原创 2013-09-27 23:30:26 · 495 阅读 · 0 评论 -
CODE 48: Maximal Rectangle
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area. public int maximalRectangle(char[][] matrix) { // Start typing your Java sol原创 2013-09-28 22:06:31 · 389 阅读 · 0 评论 -
CODE 82: N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Eac原创 2013-10-16 19:33:03 · 591 阅读 · 0 评论 -
CODE 81: N-Queens II
Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions. public int totalNQueens(int n) { // Note: The Solution objec原创 2013-10-16 22:41:02 · 727 阅读 · 0 评论 -
CODE 83: Pow(x, n)
Implement pow(x, n). public double pow(double x, int n) { // Note: The Solution object is instantiated only once and is reused by // each test case. boolean minus = false; double result =原创 2013-10-16 23:17:57 · 753 阅读 · 0 评论 -
CODE 85: Rotate Image
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place? public void rotate(int[][] matrix) { // Start原创 2013-10-19 00:28:46 · 543 阅读 · 0 评论 -
CODE 84: Anagrams
Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case. public ArrayList anagrams(String[] strs) { // Note: The Solution object is原创 2013-10-18 21:52:12 · 502 阅读 · 0 评论 -
CODE 87: Permutations
Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]. public Arr原创 2013-10-20 15:29:24 · 451 阅读 · 0 评论