11 2014 档案

摘要:Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. Solution: Solution 2: Whenever the value o 阅读全文
posted @ 2014-11-29 10:52 LiBlog 阅读(162) 评论(0) 推荐(0) 编辑
摘要:Write a function to find the longest common prefix string amongst an array of strings.Solution: 1 public class Solution { 2 public String longestC... 阅读全文
posted @ 2014-11-29 10:36 LiBlog 阅读(128) 评论(0) 推荐(0) 编辑
摘要:Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After ... 阅读全文
posted @ 2014-11-29 10:26 LiBlog 阅读(110) 评论(0) 推荐(0) 编辑
摘要:Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the c... 阅读全文
posted @ 2014-11-29 10:08 LiBlog 阅读(148) 评论(0) 推荐(0) 编辑
摘要:Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't mat... 阅读全文
posted @ 2014-11-29 09:58 LiBlog 阅读(110) 评论(0) 推荐(0) 编辑
摘要:Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Update (2014-11-02):The s... 阅读全文
posted @ 2014-11-29 07:46 LiBlog 阅读(159) 评论(0) 推荐(0) 编辑
摘要:Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with... 阅读全文
posted @ 2014-11-29 07:30 LiBlog 阅读(142) 评论(0) 推荐(0) 编辑
摘要:The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off ... 阅读全文
posted @ 2014-11-29 07:16 LiBlog 阅读(146) 评论(0) 推荐(0) 编辑
摘要: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 ... 阅读全文
posted @ 2014-11-29 06:34 LiBlog 阅读(123) 评论(0) 推荐(0) 编辑
摘要: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.Solution:... 阅读全文
posted @ 2014-11-29 06:26 LiBlog 阅读(100) 评论(0) 推荐(0) 编辑
摘要:Given two binary strings, return their sum (also a binary string). For example,a = "11"b = "1"Return "100".Solution: 1 public class Solution { 2 p... 阅读全文
posted @ 2014-11-29 06:20 LiBlog 阅读(130) 评论(0) 推荐(0) 编辑
摘要:Given a non-negative number represented as an array of digits, plus N to the number.The digits are stored such that the most significant digit is at t... 阅读全文
posted @ 2014-11-29 06:09 LiBlog 阅读(138) 评论(0) 推荐(0) 编辑
摘要:Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at... 阅读全文
posted @ 2014-11-29 06:01 LiBlog 阅读(105) 评论(0) 推荐(0) 编辑
摘要: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 cli... 阅读全文
posted @ 2014-11-29 05:54 LiBlog 阅读(114) 评论(0) 推荐(0) 编辑
摘要: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 (size that is greater or equa... 阅读全文
posted @ 2014-11-29 05:48 LiBlog 阅读(114) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree {3... 阅读全文
posted @ 2014-11-29 05:07 LiBlog 阅读(117) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le... 阅读全文
posted @ 2014-11-29 04:57 LiBlog 阅读(97) 评论(0) 推荐(0) 编辑
摘要:Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes... 阅读全文
posted @ 2014-11-29 02:51 LiBlog 阅读(174) 评论(0) 推荐(0) 编辑
摘要:Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists: A: ... 阅读全文
posted @ 2014-11-29 02:27 LiBlog 阅读(199) 评论(0) 推荐(0) 编辑
摘要: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]... 阅读全文
posted @ 2014-11-29 02:17 LiBlog 阅读(122) 评论(0) 推荐(0) 编辑
摘要: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... 阅读全文
posted @ 2014-11-29 02:12 LiBlog 阅读(128) 评论(0) 推荐(0) 编辑
摘要: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'... 阅读全文
posted @ 2014-11-29 01:52 LiBlog 阅读(151) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and ... 阅读全文
posted @ 2014-11-29 01:23 LiBlog 阅读(139) 评论(0) 推荐(0) 编辑
摘要:Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.Solution: 1 /**... 阅读全文
posted @ 2014-11-29 01:01 LiBlog 阅读(160) 评论(0) 推荐(0) 编辑
摘要:Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possibl... 阅读全文
posted @ 2014-11-28 10:36 LiBlog 阅读(176) 评论(0) 推荐(0) 编辑
摘要:Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up: Can you solve it without using extra space? 阅读全文
posted @ 2014-11-28 07:12 LiBlog 阅读(126) 评论(0) 推荐(0) 编辑
摘要:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon... 阅读全文
posted @ 2014-11-28 06:36 LiBlog 阅读(140) 评论(0) 推荐(0) 编辑
摘要:Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers.... 阅读全文
posted @ 2014-11-28 06:12 LiBlog 阅读(148) 评论(0) 推荐(0) 编辑
摘要:Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of ... 阅读全文
posted @ 2014-11-28 05:32 LiBlog 阅读(139) 评论(0) 推荐(0) 编辑
摘要:Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo... 阅读全文
posted @ 2014-11-28 04:44 LiBlog 阅读(121) 评论(0) 推荐(0) 编辑
摘要:Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two nu... 阅读全文
posted @ 2014-11-28 02:02 LiBlog 阅读(139) 评论(0) 推荐(0) 编辑
摘要:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo... 阅读全文
posted @ 2014-11-28 01:45 LiBlog 阅读(121) 评论(0) 推荐(0) 编辑
摘要:You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ... 阅读全文
posted @ 2014-11-28 00:56 LiBlog 阅读(139) 评论(0) 推荐(0) 编辑
摘要:Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes... 阅读全文
posted @ 2014-11-27 06:46 LiBlog 阅读(137) 评论(0) 推荐(0) 编辑
摘要:Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.NOTE: the return is the list of all a... 阅读全文
posted @ 2014-11-27 06:12 LiBlog 阅读(138) 评论(0) 推荐(0) 编辑
摘要:Implement pow(x, n).Analysis:x^n = x^(n/2)*x^(n/2) (*x, if n is odd).NOTE: We need consider n0) 8 res = powRecur(x,n); 9 else{10 ... 阅读全文
posted @ 2014-11-27 04:58 LiBlog 阅读(147) 评论(0) 推荐(0) 编辑
摘要: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,... 阅读全文
posted @ 2014-11-27 04:37 LiBlog 阅读(146) 评论(0) 推荐(0) 编辑
摘要:Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, ... 阅读全文
posted @ 2014-11-27 02:03 LiBlog 阅读(150) 评论(0) 推荐(0) 编辑
摘要:Sort a linked list in O(n log n) time using constant space complexity.Analsys:We use Merge Sort.NOTE: We should practice other sort algorithm, linke Q... 阅读全文
posted @ 2014-11-27 01:03 LiBlog 阅读(171) 评论(0) 推荐(0) 编辑
摘要:Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4],t... 阅读全文
posted @ 2014-11-27 00:22 LiBlog 阅读(111) 评论(0) 推荐(0) 编辑
摘要:Given an unsorted integer array, find the first missing positive integer. For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm sh... 阅读全文
posted @ 2014-11-26 23:14 LiBlog 阅读(156) 评论(0) 推荐(0) 编辑
摘要:Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.Solution:The same as N-Quee... 阅读全文
posted @ 2014-11-26 22:56 LiBlog 阅读(135) 评论(0) 推荐(0) 编辑
摘要: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 d... 阅读全文
posted @ 2014-11-26 22:55 LiBlog 阅读(139) 评论(0) 推荐(0) 编辑
摘要:Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.Solution: 1 public class Solution { 2 pu... 阅读全文
posted @ 2014-11-26 12:00 LiBlog 阅读(144) 评论(0) 推荐(0) 编辑
摘要: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 is formed from th... 阅读全文
posted @ 2014-11-26 11:31 LiBlog 阅读(126) 评论(0) 推荐(0) 编辑
摘要:You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatena... 阅读全文
posted @ 2014-11-26 09:23 LiBlog 阅读(171) 评论(0) 推荐(0) 编辑
摘要:Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complet... 阅读全文
posted @ 2014-11-25 12:54 LiBlog 阅读(136) 评论(0) 推荐(0) 编辑
摘要: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 t... 阅读全文
posted @ 2014-11-25 11:56 LiBlog 阅读(134) 评论(0) 推荐(0) 编辑
摘要: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 shoul... 阅读全文
posted @ 2014-11-25 10:51 LiBlog 阅读(250) 评论(0) 推荐(0) 编辑
摘要: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.)You have t... 阅读全文
posted @ 2014-11-25 10:11 LiBlog 阅读(112) 评论(0) 推荐(0) 编辑
摘要:Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example,S = "ADOBECOD... 阅读全文
posted @ 2014-11-24 08:04 LiBlog 阅读(128) 评论(0) 推荐(0) 编辑
摘要:Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.Analysis:For each position (i,j),... 阅读全文
posted @ 2014-11-24 06:07 LiBlog 阅读(182) 评论(0) 推荐(0) 编辑
摘要: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 representatio... 阅读全文
posted @ 2014-11-24 05:24 LiBlog 阅读(201) 评论(0) 推荐(0) 编辑
摘要: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", retu... 阅读全文
posted @ 2014-11-24 04:49 LiBlog 阅读(191) 评论(0) 推荐(0) 编辑
摘要:Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example,Given [100, 4, 200, 1, 3, 2],The longes... 阅读全文
posted @ 2014-11-23 23:57 LiBlog 阅读(113) 评论(0) 推荐(0) 编辑
摘要:Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Have you met this question in a real interview? Ana 阅读全文
posted @ 2014-11-22 04:54 LiBlog 阅读(132) 评论(0) 推荐(0) 编辑
摘要:Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Suppose a s... 阅读全文
posted @ 2014-11-22 04:10 LiBlog 阅读(136) 评论(0) 推荐(0) 编辑
摘要:Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.Yo... 阅读全文
posted @ 2014-11-22 04:07 LiBlog 阅读(126) 评论(0) 推荐(0) 编辑
摘要:Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then le... 阅读全文
posted @ 2014-11-22 04:05 LiBlog 阅读(139) 评论(0) 推荐(0) 编辑
摘要:Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the lon... 阅读全文
posted @ 2014-11-21 12:27 LiBlog 阅读(156) 评论(0) 推荐(0) 编辑
摘要:Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target valu... 阅读全文
posted @ 2014-11-21 11:27 LiBlog 阅读(170) 评论(0) 推荐(0) 编辑
摘要:Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((... 阅读全文
posted @ 2014-11-21 05:41 LiBlog 阅读(171) 评论(0) 推荐(0) 编辑
摘要:Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your al... 阅读全文
posted @ 2014-11-21 05:23 LiBlog 阅读(129) 评论(0) 推荐(0) 编辑
摘要:Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文
posted @ 2014-11-21 05:06 LiBlog 阅读(112) 评论(0) 推荐(0) 编辑
摘要:Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each numb... 阅读全文
posted @ 2014-11-21 04:40 LiBlog 阅读(162) 评论(0) 推荐(0) 编辑
摘要:Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeate... 阅读全文
posted @ 2014-11-21 04:04 LiBlog 阅读(162) 评论(0) 推荐(0) 编辑
摘要:Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-neg 阅读全文
posted @ 2014-11-21 03:22 LiBlog 阅读(167) 评论(0) 推荐(0) 编辑
摘要: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... 阅读全文
posted @ 2014-11-21 00:53 LiBlog 阅读(134) 评论(0) 推荐(0) 编辑
摘要:Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1,1,2] have the following unique pe... 阅读全文
posted @ 2014-11-20 12:15 LiBlog 阅读(119) 评论(0) 推荐(0) 编辑
摘要: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? ... 阅读全文
posted @ 2014-11-20 11:44 LiBlog 阅读(139) 评论(0) 推荐(0) 编辑
摘要:Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文
posted @ 2014-11-19 11:22 LiBlog 阅读(146) 评论(0) 推荐(0) 编辑
摘要: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 maxim 阅读全文
posted @ 2014-11-17 08:12 LiBlog 阅读(158) 评论(0) 推荐(0) 编辑
摘要: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 maximu... 阅读全文
posted @ 2014-11-17 07:04 LiBlog 阅读(123) 评论(0) 推荐(0) 编辑
摘要:Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. For example,Given n = 3,You should return the followin... 阅读全文
posted @ 2014-11-17 06:40 LiBlog 阅读(139) 评论(0) 推荐(0) 编辑
摘要: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,... 阅读全文
posted @ 2014-11-17 06:34 LiBlog 阅读(127) 评论(0) 推荐(0) 编辑
摘要: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 sequenc 阅读全文
posted @ 2014-11-17 05:54 LiBlog 阅读(157) 评论(0) 推荐(0) 编辑
摘要: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->... 阅读全文
posted @ 2014-11-17 04:42 LiBlog 阅读(132) 评论(0) 推荐(0) 编辑
摘要: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 i... 阅读全文
posted @ 2014-11-17 04:17 LiBlog 阅读(117) 评论(0) 推荐(0) 编辑
摘要: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 po... 阅读全文
posted @ 2014-11-17 04:05 LiBlog 阅读(126) 评论(0) 推荐(0) 编辑
摘要: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.N... 阅读全文
posted @ 2014-11-17 00:30 LiBlog 阅读(123) 评论(0) 推荐(0) 编辑
摘要:Implement int sqrt(int x).Compute and return the square root of x.Analysis:Using binary search to find the solution. However, what need to be consider... 阅读全文
posted @ 2014-11-17 00:18 LiBlog 阅读(170) 评论(0) 推荐(0) 编辑
摘要:Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up: Did you use extra spac... 阅读全文
posted @ 2014-11-16 23:27 LiBlog 阅读(151) 评论(0) 推荐(0) 编辑
摘要:Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted fr... 阅读全文
posted @ 2014-11-16 22:54 LiBlog 阅读(108) 评论(0) 推荐(0) 编辑
摘要:Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: Have you met 阅读全文
posted @ 2014-11-16 09:04 LiBlog 阅读(156) 评论(0) 推荐(0) 编辑
摘要:Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjace... 阅读全文
posted @ 2014-11-16 08:40 LiBlog 阅读(152) 评论(0) 推荐(0) 编辑
摘要:Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array A = [1,1,1,2,2,3],Your function should ... 阅读全文
posted @ 2014-11-16 08:08 LiBlog 阅读(120) 评论(0) 推荐(0) 编辑
摘要:Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for... 阅读全文
posted @ 2014-11-16 07:59 LiBlog 阅读(119) 评论(0) 推荐(0) 编辑
摘要:Given a sorted linked list, delete all duplicates such that each element appear only once. For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3,... 阅读全文
posted @ 2014-11-16 07:46 LiBlog 阅读(109) 评论(0) 推荐(0) 编辑
摘要:Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example,Given 1->2... 阅读全文
posted @ 2014-11-16 07:42 LiBlog 阅读(123) 评论(0) 推荐(0) 编辑
摘要: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 o... 阅读全文
posted @ 2014-11-16 07:16 LiBlog 阅读(132) 评论(0) 推荐(0) 编辑
摘要: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 numb... 阅读全文
posted @ 2014-11-16 06:32 LiBlog 阅读(166) 评论(0) 推荐(0) 编辑
摘要:Given a collection of integers that might contain duplicates, S, return all possible subsets.Note:Elements in a subset must be in non-descending order... 阅读全文
posted @ 2014-11-16 06:02 LiBlog 阅读(147) 评论(0) 推荐(0) 编辑
摘要:Reverse a linked list from position m to n. Do it in-place and in one-pass. For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->... 阅读全文
posted @ 2014-11-16 05:00 LiBlog 阅读(130) 评论(0) 推荐(0) 编辑
摘要:Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example:Given "25525511135",return ["25... 阅读全文
posted @ 2014-11-15 23:33 LiBlog 阅读(122) 评论(0) 推荐(0) 编辑
摘要: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 con... 阅读全文
posted @ 2014-11-15 08:39 LiBlog 阅读(142) 评论(0) 推荐(0) 编辑
摘要:Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.... 阅读全文
posted @ 2014-11-15 06:56 LiBlog 阅读(148) 评论(0) 推荐(0) 编辑
摘要:'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching should cover the entire input stri... 阅读全文
posted @ 2014-11-15 06:17 LiBlog 阅读(270) 评论(0) 推荐(0) 编辑
摘要: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].Anaylsis:Me... 阅读全文
posted @ 2014-11-14 11:05 LiBlog 阅读(132) 评论(0) 推荐(0) 编辑
摘要:Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initial... 阅读全文
posted @ 2014-11-14 10:39 LiBlog 阅读(146) 评论(0) 推荐(0) 编辑
摘要: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 ... 阅读全文
posted @ 2014-11-09 07:03 LiBlog 阅读(196) 评论(0) 推荐(0) 编辑
摘要: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 n... 阅读全文
posted @ 2014-11-09 06:01 LiBlog 阅读(239) 评论(0) 推荐(0) 编辑
摘要: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 identical an... 阅读全文
posted @ 2014-11-09 05:42 LiBlog 阅读(125) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: But the fol 阅读全文
posted @ 2014-11-09 05:36 LiBlog 阅读(135) 评论(0) 推荐(0) 编辑
摘要:Given inorder and postorder traversal of a tree, construct the binary tree.Solution: 1 /** 2 * Definition for binary tree 3 * public class TreeNode ... 阅读全文
posted @ 2014-11-09 02:06 LiBlog 阅读(158) 评论(0) 推荐(0) 编辑
摘要: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 ... 阅读全文
posted @ 2014-11-09 00:45 LiBlog 阅读(130) 评论(0) 推荐(0) 编辑
摘要:Given an array where elements are sorted in ascending order, convert it to a height balanced BST.Solution: 1 /** 2 * Definition for binary tree 3 * ... 阅读全文
posted @ 2014-11-09 00:31 LiBlog 阅读(233) 评论(0) 推荐(0) 编辑
摘要:Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Solution: 1 /** 2 * Definition for singl... 阅读全文
posted @ 2014-11-09 00:23 LiBlog 阅读(195) 评论(0) 推荐(0) 编辑
摘要: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 which the depth... 阅读全文
posted @ 2014-11-08 23:31 LiBlog 阅读(108) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文
posted @ 2014-11-08 12:36 LiBlog 阅读(128) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum ... 阅读全文
posted @ 2014-11-08 12:22 LiBlog 阅读(130) 评论(0) 推荐(0) 编辑
摘要: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.Fo... 阅读全文
posted @ 2014-11-08 12:11 LiBlog 阅读(144) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, flatten it to a linked list in-place. For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened ... 阅读全文
posted @ 2014-11-08 12:04 LiBlog 阅读(146) 评论(0) 推荐(0) 编辑
摘要:Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文
posted @ 2014-11-08 11:23 LiBlog 阅读(156) 评论(0) 推荐(0) 编辑
摘要: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 your algorithm to use... 阅读全文
posted @ 2014-11-08 09:28 LiBlog 阅读(123) 评论(0) 推荐(0) 编辑
摘要:Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,... 阅读全文
posted @ 2014-11-08 09:23 LiBlog 阅读(114) 评论(0) 推荐(0) 编辑
摘要:Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo... 阅读全文
posted @ 2014-11-08 09:09 LiBlog 阅读(140) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree. For example:Given the below binary tree, 1 ... 阅读全文
posted @ 2014-11-08 07:54 LiBlog 阅读(220) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示