10 2014 档案

[Leetcode] Word Break
摘要：Given a stringsand a dictionary of wordsdict, determine ifscan be segmented into a space-separated sequence of one or more dictionary words.For exampl... 阅读全文
posted @ 2014-10-31 15:04 Phoebe815 阅读(125) 评论(0) 推荐(0)
[Leetcode] Evaluate Reverse Polish Notation
摘要：Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another express... 阅读全文
posted @ 2014-10-31 13:44 Phoebe815 阅读(161) 评论(0) 推荐(0)
[Leetcode] Distinct Subsequences
摘要：Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig... 阅读全文
posted @ 2014-10-30 02:41 Phoebe815 阅读(242) 评论(0) 推荐(0)
[Leetcode] Triangle
摘要：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 fol... 阅读全文
posted @ 2014-10-29 13:06 Phoebe815 阅读(150) 评论(0) 推荐(0)
[Leetcode] Single Number II
摘要：Given an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a linear runtime comp... 阅读全文
posted @ 2014-10-27 02:56 Phoebe815 阅读(174) 评论(0) 推荐(0)
[Leetcode] Convert Sorted Array to Binary Search Tree
摘要：Given an array where elements are sorted in ascending order, convert it to a height balanced BST.Solution:/** * Definition for binary tree * public cl... 阅读全文
posted @ 2014-10-27 02:19 Phoebe815 阅读(113) 评论(0) 推荐(0)
[Leetcode] Integer to Roman
摘要：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-10-27 01:12 Phoebe815 阅读(141) 评论(0) 推荐(0)
[Leetcode] Longest Common Prefix
摘要：Write a function to find the longest common prefix string amongst an array of strings.Solution:第0个字符串和其他字符串逐个求前缀对strs做了一个排序操作：Arrays.sort(strs);使得最终结果... 阅读全文
posted @ 2014-10-26 16:13 Phoebe815 阅读(138) 评论(0) 推荐(0)
[Leetcode] Plus One
摘要：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-10-26 16:11 Phoebe815 阅读(127) 评论(0) 推荐(0)
[Leetcode] Palindrome Number
摘要：Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (i... 阅读全文
posted @ 2014-10-26 15:39 Phoebe815 阅读(150) 评论(0) 推荐(0)
[Leetcode] 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: 1 / \ ... 阅读全文
posted @ 2014-10-26 15:17 Phoebe815 阅读(135) 评论(0) 推荐(0)
[Leetcode] Length of Last Word
摘要：Given a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word doe... 阅读全文
posted @ 2014-10-26 13:54 Phoebe815 阅读(136) 评论(0) 推荐(0)
[Leetcode] 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 which the depth... 阅读全文
posted @ 2014-10-26 13:29 Phoebe815 阅读(172) 评论(0) 推荐(0)
[Leetcode] Remove Element
摘要：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-10-26 12:20 Phoebe815 阅读(134) 评论(0) 推荐(0)
[Leetcode] Populating Next Right Pointers in Each Node
摘要：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2014-10-26 02:00 Phoebe815 阅读(158) 评论(0) 推荐(0)
[Leetcode] Trapping Rain Water
摘要：Givennnon-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.Fo... 阅读全文
posted @ 2014-10-25 05:16 Phoebe815 阅读(136) 评论(0) 推荐(0)
[Leetcode] Container With Most Water
摘要：Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ... 阅读全文
posted @ 2014-10-25 05:12 Phoebe815 阅读(153) 评论(0) 推荐(0)
[Leetcode] Minimum Path Sum
摘要：Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo... 阅读全文
posted @ 2014-10-24 16:31 Phoebe815 阅读(135) 评论(0) 推荐(0)
[Leetcode] 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 i... 阅读全文
posted @ 2014-10-24 16:27 Phoebe815 阅读(121) 评论(0) 推荐(0)
[Leetcode] Unique Paths
摘要：A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ... 阅读全文
posted @ 2014-10-24 16:10 Phoebe815 阅读(137) 评论(0) 推荐(0)
[Leetcode] 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,... 阅读全文
posted @ 2014-10-24 16:02 Phoebe815 阅读(143) 评论(0) 推荐(0)
[Leetcode] Binary Tree Postorder Traversal
摘要：Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].No... 阅读全文
posted @ 2014-10-22 13:43 Phoebe815 阅读(171) 评论(0) 推荐(0)
[Leetcode] Binary Tree Preorder Traversal
摘要：Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].Not... 阅读全文
posted @ 2014-10-22 13:36 Phoebe815 阅读(156) 评论(0) 推荐(0)
[Leetcode] Binary Tree Inorder Traversal
摘要：Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note... 阅读全文
posted @ 2014-10-22 12:36 Phoebe815 阅读(162) 评论(0) 推荐(0)
[Leetcode] Edit Distance
摘要：Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol... 阅读全文
posted @ 2014-10-21 05:26 Phoebe815 阅读(145) 评论(0) 推荐(0)
[Leetcode] Convert Sorted List to Binary Search Tree
摘要：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 1 /** 2 * Definition for singly-linked ... 阅读全文
posted @ 2014-10-21 02:44 Phoebe815 阅读(163) 评论(0) 推荐(0)
[Leetcode] Remove Nth Node From End of List
摘要：Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After re... 阅读全文
posted @ 2014-10-21 02:06 Phoebe815 阅读(153) 评论(0) 推荐(0)
[Leetcode] 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.Solution:... 阅读全文
posted @ 2014-10-21 01:43 Phoebe815 阅读(134) 评论(0) 推荐(0)
[Leetcode] Remove Duplicates from Sorted List
摘要：Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, return1->2.Given1->1->2->3->3, retu... 阅读全文
posted @ 2014-10-21 01:32 Phoebe815 阅读(117) 评论(0) 推荐(0)
[Leetcode] Swap Nodes in Pairs
摘要：Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文
posted @ 2014-10-21 01:13 Phoebe815 阅读(105) 评论(0) 推荐(0)
[Leetcode] Roman to Integer
摘要：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.Solution：此题是要求把罗马数字转换成数字。首先，学习一下罗马数字，参考罗马数字罗... 阅读全文
posted @ 2014-10-19 12:34 Phoebe815 阅读(158) 评论(0) 推荐(0)
[Leetcode] Search Insert Position
摘要：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-10-19 06:22 Phoebe815 阅读(121) 评论(0) 推荐(0)
[Leetcode] String to Integer (atoi)
摘要：Implementatoito convert a string to an integer.Hint:Carefully consider all possible input cases. If you want a challenge, please do not see below and ... 阅读全文
posted @ 2014-10-19 06:16 Phoebe815 阅读(139) 评论(0) 推荐(0)
[Leetcode] Count and Say
摘要：The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as"tw... 阅读全文
posted @ 2014-10-19 05:45 Phoebe815 阅读(172) 评论(0) 推荐(0)
[Leetcode] Valid Palindrome
摘要：Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana... 阅读全文
posted @ 2014-10-19 03:46 Phoebe815 阅读(121) 评论(0) 推荐(0)
[Leetcode] Implement strStr()
摘要：Implement strStr().Returns a pointer to the first occurrence of needle in haystack, ornullif needle is not part of haystack.Solution: 1 public class S... 阅读全文
posted @ 2014-10-18 07:32 Phoebe815 阅读(126) 评论(0) 推荐(0)
[Leetcode] N-Queens II
摘要：Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.Solution:N-Queens 问题的简化版。pu... 阅读全文
posted @ 2014-10-18 07:22 Phoebe815 阅读(121) 评论(0) 推荐(0)
[Leetcode] N-Queens
摘要：Then-queens puzzle is the problem of placingnqueens on ann×nchessboard such that no two queens attack each other.Given an integern, return all distinc... 阅读全文
posted @ 2014-10-18 07:10 Phoebe815 阅读(165) 评论(0) 推荐(0)
[Leetcode] Climbing Stairs
摘要：You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb... 阅读全文
posted @ 2014-10-17 15:19 Phoebe815 阅读(130) 评论(0) 推荐(0)
[Leetcode] Linked List Cycle II
摘要：Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?Sol... 阅读全文
posted @ 2014-10-17 15:01 Phoebe815 阅读(113) 评论(0) 推荐(0)
[Leetcode] Linked List Cycle
摘要：Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?Solution:快慢指针。 1 /** 2 * Definition for s... 阅读全文
posted @ 2014-10-17 14:20 Phoebe815 阅读(100) 评论(0) 推荐(0)
[Leetcode] Unique Binary Search Trees II
摘要：Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文
posted @ 2014-10-17 14:10 Phoebe815 阅读(135) 评论(0) 推荐(0)
[Leetcode] Unique Binary Search Trees
摘要：Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1... 阅读全文
posted @ 2014-10-16 15:25 Phoebe815 阅读(148) 评论(0) 推荐(0)
[Leetcode] Best Time to Buy and Sell Stock III
摘要：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2014-10-16 13:56 Phoebe815 阅读(114) 评论(0) 推荐(0)
[Leetcode] Best Time to Buy and Sell Stock II
摘要：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2014-10-16 12:52 Phoebe815 阅读(123) 评论(0) 推荐(0)
[Leetcode] Best Time to Buy and Sell Stock
摘要：Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文
posted @ 2014-10-16 06:30 Phoebe815 阅读(133) 评论(0) 推荐(0)
[Leetcode] 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 identical an... 阅读全文
posted @ 2014-10-16 06:12 Phoebe815 阅读(127) 评论(0) 推荐(0)
[Leetcode] Reverse Integer
摘要：Reverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321click to show spoilers.Have you thought about this?Here are som... 阅读全文
posted @ 2014-10-16 06:11 Phoebe815 阅读(103) 评论(0) 推荐(0)
[Leetcode] 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 down to the farthest le... 阅读全文
posted @ 2014-10-16 05:03 Phoebe815 阅读(122) 评论(0) 推荐(0)
[Leetcode] Single Number
摘要：Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity... 阅读全文
posted @ 2014-10-16 04:55 Phoebe815 阅读(131) 评论(0) 推荐(0)
Leetcode 第一遍刷完
摘要：2014/10/15Leetcode第一刷总算结束，时间拖太长了，希望第二遍能快一点，争取一个月能刷完第二遍？？哈哈哈哈 阅读全文
posted @ 2014-10-16 04:41 Phoebe815 阅读(571) 评论(0) 推荐(0)
[Leetcode] Word Ladder II
摘要：Given two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, such that:Only one letter can be changed... 阅读全文
posted @ 2014-10-13 16:10 Phoebe815 阅读(157) 评论(0) 推荐(0)
String, StringBuffer, StringBuilder(转载)
摘要：http://blog.csdn.net/rmn190/article/details/1492013String 字符串常量StringBuffer 字符串变量（线程安全）StringBuilder 字符串变量（非线程安全）简要的说， String 类型和 StringBuffer 类型的主要性能... 阅读全文
posted @ 2014-10-13 15:10 Phoebe815 阅读(121) 评论(0) 推荐(0)
[Leetcode] Longest Substring Without Repeating Characters
摘要：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo... 阅读全文
posted @ 2014-10-12 15:38 Phoebe815 阅读(155) 评论(0) 推荐(0)
[Leetcode] Clone Graph
摘要：Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.OJ's undirected graph serialization:Nodes are labeled uniq... 阅读全文
posted @ 2014-10-12 07:35 Phoebe815 阅读(122) 评论(0) 推荐(0)
[Leetcode] LRU Cache
摘要：Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the valu... 阅读全文
posted @ 2014-10-11 14:11 Phoebe815 阅读(191) 评论(0) 推荐(0)
Java之美[从菜鸟到高手演变]之HashMap、HashTable(转载)
摘要：http://blog.csdn.net/zhangerqing/article/details/8193118 阅读全文
posted @ 2014-10-11 13:50 Phoebe815 阅读(129) 评论(0) 推荐(0)
[Leetcode] Copy List with Random Pointer
摘要：A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy ... 阅读全文
posted @ 2014-10-09 15:39 Phoebe815 阅读(115) 评论(0) 推荐(0)
[Java] StringBuffer类
摘要：http://www.cnblogs.com/springcsc/archive/2009/12/03/1616330.html注：StringBuffer类和String一样，也用来代表字符串，只是由于StringBuffer的内部实现方式和String不同，所以StringBuffer在进行字符... 阅读全文
posted @ 2014-10-09 05:14 Phoebe815 阅读(133) 评论(0) 推荐(0)
[Leetcode] Wildcard Matching
摘要：Implement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of characters (including the e... 阅读全文
posted @ 2014-10-02 13:49 Phoebe815 阅读(204) 评论(0) 推荐(0)
[Leetcode] Substring with Concatenation of All Words
摘要：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 concatenati... 阅读全文
posted @ 2014-10-01 14:57 Phoebe815 阅读(182) 评论(0) 推荐(0)