随笔分类 -  Leetcode

上一页 1 2 3 4 5 6 7 8 下一页
[Leetcode] Partition List
摘要：Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi... 阅读全文
posted @ 2014-11-16 09:00 Phoebe815 阅读(162) 评论(0) 推荐(0)
[Leetcode] Anagrams
摘要：Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.Solution:http://www.cnblogs.com/Annie... 阅读全文
posted @ 2014-11-16 07:56 Phoebe815 阅读(142) 评论(0) 推荐(0)
[Leetcode] Search in Rotated Sorted Array II
摘要：Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Write a function to... 阅读全文
posted @ 2014-11-16 06:57 Phoebe815 阅读(147) 评论(0) 推荐(0)
[Leetcode] Search in Rotated Sorted Array
摘要：Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are given a target value t... 阅读全文
posted @ 2014-11-16 04:45 Phoebe815 阅读(187) 评论(0) 推荐(0)
[Leetcode] Path Sum II
摘要：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 andsum =... 阅读全文
posted @ 2014-11-16 03:16 Phoebe815 阅读(102) 评论(0) 推荐(0)
[Leetcode] Path Sum
摘要：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-16 02:47 Phoebe815 阅读(124) 评论(0) 推荐(0)
[Leetcode] Search a 2D Matrix
摘要：Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l... 阅读全文
posted @ 2014-11-15 17:21 Phoebe815 阅读(143) 评论(0) 推荐(0)
[Leetcode] Populating Next Right Pointers in Each Node II
摘要：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-15 16:48 Phoebe815 阅读(154) 评论(0) 推荐(0)
[Leetcode] Valid Parentheses
摘要：Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.The brackets must close in the correct ... 阅读全文
posted @ 2014-11-15 14:15 Phoebe815 阅读(153) 评论(0) 推荐(0)
[Leetcode] 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 node down to the nearest le... 阅读全文
posted @ 2014-11-15 08:57 Phoebe815 阅读(160) 评论(0) 推荐(0)
[Leetcode] Gas Station
摘要：There areNgas stations along a circular route, where the amount of gas at stationiisgas[i].You have a car with an unlimited gas tank and it costscost[... 阅读全文
posted @ 2014-11-15 08:27 Phoebe815 阅读(192) 评论(0) 推荐(0)
[Leetcode] Remove Duplicates from Sorted Array
摘要：Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.Do not allocate extra space for a... 阅读全文
posted @ 2014-11-14 16:59 Phoebe815 阅读(128) 评论(0) 推荐(0)
[Leetcode] Rotate Image
摘要：You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?Solution:public cla... 阅读全文
posted @ 2014-11-14 16:48 Phoebe815 阅读(136) 评论(0) 推荐(0)
[Leetcode] Permutation Sequence
摘要：The set[1,2,3,…,n]contains a total ofn! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie... 阅读全文
posted @ 2014-11-14 16:22 Phoebe815 阅读(171) 评论(0) 推荐(0)
[Leetcode] Palindrome Partitioning
摘要：Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv... 阅读全文
posted @ 2014-11-14 12:02 Phoebe815 阅读(145) 评论(0) 推荐(0)
[Leetcode] Letter Combinations of a Phone Number
摘要：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-13 13:02 Phoebe815 阅读(117) 评论(0) 推荐(0)
[Leetcode] Subsets II
摘要：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-13 09:06 Phoebe815 阅读(131) 评论(0) 推荐(0)
[Leetcode] Subsets
摘要：Given a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not co... 阅读全文
posted @ 2014-11-13 08:59 Phoebe815 阅读(131) 评论(0) 推荐(0)
[Leetcode] 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,... 阅读全文
posted @ 2014-11-13 06:05 Phoebe815 阅读(181) 评论(0) 推荐(0)
[Leetcode] Generate Parentheses
摘要：Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))... 阅读全文
posted @ 2014-11-13 05:44 Phoebe815 阅读(152) 评论(0) 推荐(0)

上一页 1 2 3 4 5 6 7 8 下一页