樱子飞飞-CSDN博客

原创 Distinct Subsequences

Distinct SubsequencesGiven a string S and a string T, count the number of distinct subsequences ofT in S.A subsequence of a string is a new string which is formed from the original string by

2014-09-19 20:02:50 339

原创 Scramble String

Scramble StringGiven 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": gre

2014-09-19 19:22:05 417

原创 Populating Next Right Pointers in Each Node

Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right node. If the

2014-09-18 11:28:00 298

原创 Longest Consecutive Sequence

Longest Consecutive SequenceGiven an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecuti

2014-09-18 11:21:42 294

原创 Maximum Subarray

Maximum SubarrayFind 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 su

2014-09-18 11:11:21 314

原创 Gas Station

Gas StationThere are N gas stations along a circular route, where the amount of gas at stationi is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from

2014-09-18 10:37:37 639

原创 Palindrome Number

Palindrome NumberDetermine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are th

2014-09-18 10:29:43 300

原创 Reverse Integer

Reverse IntegerReverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions

2014-09-18 10:17:41 309

原创 Letter Combinations of a Phone Number

Letter Combinations of a Phone NumberGiven a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone but

2014-09-17 08:57:37 375

原创 Swap Nodes in Pairs

Swap Nodes in PairsGiven 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 algorithm should use o

2014-09-17 08:49:38 303

原创 LastNode of 完全二叉树

题目：求完全二叉树中，最后

2014-09-12 11:15:54 479

原创 Evaluate Reverse Polish Notation

Evaluate Reverse Polish NotationEvaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression

2014-09-11 14:48:48 267

原创 Reverse Words in a String

Reverse Words in a StringTotal Accepted: 31611 Total Submissions: 224230 Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sk

2014-09-11 14:38:38 307

原创 Word Break

Word BreakGiven a string s and a dictionary of words dict, determine ifs can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",

2014-09-11 11:09:18 462

原创 Combinations

CombinationsGiven two integers n and k, return all possible combinations ofk numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2],

2014-09-11 11:00:46 304

原创 Remove Element

Remove ElementGiven 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 matter what you leave beyond th

2014-09-11 10:56:02 312

原创 Copy List with Random Pointer

Copy List with Random PointerA 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 of the list.

2014-09-11 10:45:10 280

原创 Rotate List

Rotate ListGiven 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.

2014-09-11 10:34:23 257

原创各种List Sort

排序算法，

2014-09-11 09:50:45 334

原创 Add Binary

Add BinaryGiven two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".

2014-09-09 15:09:06 331

原创 Anagrams

AnagramsGiven an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.题目：理解anagrams的意思，

2014-09-09 14:40:30 421

原创 Sqrt(x)

Sqrt(x)Implement int sqrt(int x).Compute and return the square root of x.题目：求平凡

2014-09-08 09:55:24 1457

原创 Word Ladder

Word LadderGiven two words (start and end), and a dictionary, find the length of shortest transformation sequence fromstart to end, such that:Only one letter can be changed at a timeEach i

2014-09-08 09:30:37 393

原创 Valid Palindrome

Valid PalindromeGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."r

2014-09-07 16:58:06 236

原创 Set Matrix Zeroes

Set Matrix ZeroesTotal Accepted: 16376 Total Submissions: 53084 Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.

2014-09-07 16:41:22 403

原创 Climbing Stairs

Climbing StairsYou 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?题目：爬楼梯，每次

2014-09-07 16:34:59 267

原创 Pow(x, n)

Pow(x, n)Implement pow(x, n).题目：实现求幂函数。分析：

2014-09-06 20:43:37 539

原创 Implement strStr()

Implement strStr()Total Accepted: 18315 Total Submissions: 83921 Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack

2014-09-06 20:28:52 249

原创 Sum Root to Leaf Numbers

Sum Root to Leaf NumbersGiven a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the nu

2014-09-04 22:38:19 253

原创各种Parentheses

Valid ParenthesesGiven a string containing just the characters '(', ')','{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "

2014-09-04 22:11:05 316

原创 2sum 3sum 4sum 各种sum

Two SumGiven 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 numbers such that they add up to the

2014-09-02 21:04:41 447

原创 Flatten Binary Tree to Linked List

Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like: 1 \

2014-08-31 19:41:13 243

原创 Unique Binary Search Trees I & II

Unique Binary Search TreesGiven 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

2014-08-28 17:02:22 273

原创 Recover Binary Search Tree

Recover Binary Search TreeTwo 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 strai

2014-08-28 16:34:24 234

原创 Convert Sorted Array（List） to Binary Search Tree

Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.题意：用一个有序数组

2014-08-28 16:27:40 417

原创 Validate Binary Search Tree

Validate Binary Search TreeGiven 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 k

2014-08-28 09:42:22 268

原创 Binary Tree Maximum Path Sum

Binary Tree Maximum Path Sum My SubmissionsGiven 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,

2014-08-26 21:37:18 387

原创 Remove Duplicates from Sorted List I II

Remove Duplicates from Sorted List My SubmissionsGiven a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given

2014-08-25 20:08:23 326

原创 Reverse Linked List II

Reverse Linked List II 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->5->NULL.

2014-08-25 19:47:30 413 1

原创 Permutation Sequence

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 =

2014-08-23 19:42:25 350

空空如也

空空如也