Leetcode题解第29页

[LeetCode] 033. Search in Rotated Sorted Array (Hard) (C++)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode033.SearchinRotatedSortedArray

hcbbt·2015-03-13 16:00

[LeetCode] 032. Longest Valid Parentheses (Hard) (C++)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode032.LongestValidParentheses

hcbbt·2015-03-13 15:00

[LeetCode] 031. Next Permutation (Medium) (C++/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode031.NextPermutation

hcbbt·2015-03-07 16:00

[LeetCode] 030. Substring with Concatenation of All Words (Hard) (C++/Java)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode030.SubstringwithConcatenationofAllWords

hcbbt·2015-03-06 22:00

[LeetCode] 029. Divide Two Integers (Medium) (C++/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode029.DivideTwoIntegers

hcbbt·2015-03-06 15:00

[LeetCode] 028. Implement strStr() (Easy) (C++/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode028.ImplementstrStr

hcbbt·2015-03-06 15:00

[LeetCode] 027. Remove Element (Easy) (C++)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode027.RemoveElement

hcbbt·2015-03-06 11:00

[LeetCode] 026. Remove Duplicates from Sorted Array (Easy) (C++/Java)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode026.RemoveDuplicatesfromSortedArray

hcbbt·2015-03-05 15:00

[LeetCode] 025. Reverse Nodes in k-Group (Hard) (C++/Java)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode025.ReverseNodesink-Group

hcbbt·2015-03-05 15:00

[LeetCode] 024. Swap Nodes in Pairs (Medium) (C++/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode024.SwapNodesinPairs

hcbbt·2015-03-05 14:00

[LeetCode] 023. Merge k Sorted Lists (Hard) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode023.MergekSortedLists

hcbbt·2015-03-05 11:00

[LeetCode] 022. Generate Parentheses (Medium) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode022.Generate_Parentheses

hcbbt·2015-03-05 10:00

[LeetCode] 021. Merge Two Sorted Lists (Easy) (C++/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode021.Merge_Two_Sorted_Lists

hcbbt·2015-03-04 20:00

[LeetCode] 020. Valid Parentheses (Easy) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode020.Valid_Parentheses

hcbbt·2015-03-04 19:00

[LeetCode] 019. Remove Nth Node From End of List (Easy) (C++/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode019.Remove_Nth_Node_From_End_of_List

hcbbt·2015-03-04 19:00

[LeetCode] 016. 3Sum Closest (Medium) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode016.3Sum_Closest

hcbbt·2015-03-03 19:00

[LeetCode] 015. 3Sum (Medium) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode015.3Sum(Medium

hcbbt·2015-03-03 18:00

[LeetCode] 013. Roman to Integer (Easy) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode013.Roman_to_Integer

hcbbt·2015-03-02 23:00

[LeetCode] 012. Integer to Roman (Medium) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode012.Integer_to_Roman

hcbbt·2015-03-02 23:00

[LeetCode] 011. Container With Most Water (Medium) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode011.Container_With_Most_Water

hcbbt·2015-03-02 22:00

[LeetCode] 010. Regular Expression Matching (Hard) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode010.Regular_Expression_Matching

hcbbt·2015-03-02 11:00

[LeetCode] 009. Palindrome Number (Easy) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode009.Palindrome_Number

hcbbt·2015-03-01 10:00

[LeetCode] 007. Reverse Integer (Easy) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode007.Reverse_Integer

hcbbt·2015-02-28 00:09

[LeetCode] 007. Reverse Integer (Easy) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode007.Reverse_Integer

hcbbt·2015-02-28 00:00

[LeetCode] 006. ZigZag Conversion (Easy) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode006.ZigZag_Conversion

hcbbt·2015-02-28 00:00

[LeetCode] 005. Longest Palindromic Substring (Medium) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode005.Longest_Palindromic_Substring

hcbbt·2015-02-28 00:00

[LeetCode] 004. Median of Two Sorted Arrays (Hard) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode004.Median_of_Two_Sorted_Arrays

hcbbt·2015-02-28 00:00

[LeetCode] 003. Longest Substring Without Repeating Characters (Medium) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode003.Longest_Substring_Without_Repeating_Characters

hcbbt·2015-02-27 12:00

[LeetCode] 002. Add Two Numbers (Medium) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode002.Add_Two_Numbers

hcbbt·2015-02-27 12:00

[LeetCode] 001. Two Sum (Medium) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode001.Two_Sum(Medium

hcbbt·2015-02-27 12:00

LeetCode题解 || Two Sum问题

question：Givenanarrayofintegers,findtwonumberssuchthattheyadduptoaspecifictargetnumber.ThefunctiontwoSumshouldreturnindicesofthetwonumberssuchthattheyadduptothetarget,whereindex1mustbelessthanindex2.P

hustyangju·2015-01-13 10:19

[LeetCode]Interleaving String

= "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac",returntrue.When s3 = "aadbbbaccc",returnfalse.二维动态规划参考LeetCode

u014691362·2014-11-23 19:00

[LeetCode] Unique Binary Search Trees

Forexample,Given n =3,thereareatotalof5uniqueBST's.13321 \///\\ 321132 //\\ 2123dynamicprogramming参照 LeetCode

u014691362·2014-11-23 16:00

LeetCode题解：Binary Tree Level Order Traversal

有点胃痛，这篇仓促写完……见谅Givenabinarytree,returnthe levelorder traversalofitsnodes'values.(ie,fromlefttoright,levelbylevel).Forexample:Givenbinarytree {3,9,20,#,#,15,7},3 /\ 920 /\ 157 returnitslevelordertraver

u012403246·2014-11-20 23:00

LeetCode题解：Reverse Integer （3种解法）

Reversedigitsofaninteger.Example1: x=123,return321Example2: x=-123,return-321题解：输入一个整数，然后倒过来输出它。解决思路：其实这道题看起来非常简单，要实现也是几行代码的事。但是有个小问题容易被忽略（刷过一些找工作神书的话估计都能考虑到），就是边界问题。什么意思呢？如果我们输入的整数超出了int的表达范围，这个问题要怎么

u012403246·2014-11-19 20:00

LeetCode题解：MinStack(三种解法)

Designastackthatsupportspush,pop,top,andretrievingtheminimumelementinconstanttime.push(x)--Pushelementxontostack.pop()--Removestheelementontopofthestack.top()--Getthetopelement.getMin()--Retrievethemi

u012403246·2014-11-18 10:00

LeetCode题解：Symmetric Tree（有4种解法）

Givenabinarytree,checkwhetheritisamirrorofitself(ie,symmetricarounditscenter).Forexample,thisbinarytreeissymmetric:1 /\ 22 /\/\ 3443 Butthefollowingisnot:1 /\ 22 \\ 33 题解：判断一棵二叉树是否是自身的镜像，即：一棵爱美的二叉树去照镜

u012403246·2014-11-17 19:00

LeetCode题解：Count and Say解法

Thecount-and-saysequenceisthesequenceofintegersbeginningasfollows:1,11,21,1211,111221,...1 isreadoffas "one1" or 11.11 isreadoffas "two1s" or 21.21 isreadoffas "one2,then one1" or 1211.Givenaninteger

u012403246·2014-11-16 22:00

LeetCode题解：Single Number最优解法

Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory?题目大意：一个整数数组中，除了一个数只出现了一次

u012403246·2014-11-16 19:00

LeetCode题解——Edit Distance

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 the following 3 operations permitted on a word:

Mir_Tempo·2014-08-23 14:00

HDU 1027 Ignatius and the Princess II 选择序列题解

如何直接选择第k个序列，可以参考本博客的Leetcode题解。Leetcode题有个一模一样的题目。不过没有使

kenden23·2014-08-20 08:00

LeetCode题解汇总（C++ Java Python，含题目翻译）

lilong_dream·2014-02-23 17:09

[置顶] 索(shen)引(keng)大全

计算机网络_学习笔记索引「索引」《Python基础教程》学习笔记XMLFromActionScript[AS中的XML学习笔记]《算法导论》习题解答搬运&&学习笔记索引目录）（已废） [LeetCode]Leetcode

hcbbt·2014-01-23 11:00

LeetCode题解：Candy

CandyThereareNchildrenstandinginaline.Eachchildisassignedaratingvalue.Youaregivingcandiestothesechildrensubjectedtothefollowingrequirements:Eachchildmusthaveatleastonecandy.Childrenwithahigherratingge

MagiSu·2014-01-07 14:00

LeetCode总结

除各个题目有特殊巧妙的解法以外，大部分题目都是经典的算法或者数据结构，因此做了如下小结，具体的解题思路可以搜索我的博客：LeetCode题解题目算法数据结构注意事项CloneGraphBFS哈希表WordLadderIIBFS

Allanxl·2014-01-04 20:03

[置顶] LeetCode总结

除各个题目有特殊巧妙的解法以外，大部分题目都是经典的算法或者数据结构，因此做了如下小结，具体的解题思路可以搜索我的博客：LeetCode题解题目算法数据结构注意事项CloneGraphBFS哈希表WordLadderIIBFS

lanxu_yy·2014-01-04 20:00

LeetCode题解： Valid Number

ValidNumberValidateifagivenstringisnumeric.Someexamples:"0"=>true"0.1"=>true"abc"=>false"1a"=>false"2e10"=>trueNote:Itisintendedfortheproblemstatementtobeambiguous.Youshouldgatherallrequirementsupfron

MagiSu·2013-12-16 13:00

LeetCode题解：Implement strStr()

ImplementstrStr()ImplementstrStr().Returnsapointertothefirstoccurrenceofneedleinhaystack,ornullifneedleisnotpartofhaystack.思路：首先想到的是KMP算法。不过似乎不是很成功，提交了之后总是报Runtimeerror，但是我这里无论本地机器跑还是在valgrind上跑都不报错。奇

MagiSu·2013-12-16 06:00

LeetCode题解：LRU Cache

LRUCacheDesignandimplementadatastructureforLeastRecentlyUsed(LRU)cache.Itshouldsupportthefollowingoperations:getandset.get(key)-Getthevalue(willalwaysbepositive)ofthekeyifthekeyexistsinthecache,otherw

MagiSu·2013-12-02 16:00

LeetCode题解：Wildcard Matching

WildcardMatchingImplementwildcardpatternmatchingwithsupportfor'?'and'*'.'?'Matchesanysinglecharacter. '*'Matchesanysequenceofcharacters(includingtheemptysequence). Thematchingshouldcovertheentireinpu

MagiSu·2013-11-30 03:00

推荐频道

Leetcode题解

[LeetCode] 033. Search in Rotated Sorted Array (Hard) (C++)

[LeetCode] 032. Longest Valid Parentheses (Hard) (C++)

[LeetCode] 031. Next Permutation (Medium) (C++/Python)

[LeetCode] 030. Substring with Concatenation of All Words (Hard) (C++/Java)

[LeetCode] 029. Divide Two Integers (Medium) (C++/Python)

[LeetCode] 028. Implement strStr() (Easy) (C++/Python)

[LeetCode] 027. Remove Element (Easy) (C++)

[LeetCode] 026. Remove Duplicates from Sorted Array (Easy) (C++/Java)

[LeetCode] 025. Reverse Nodes in k-Group (Hard) (C++/Java)

[LeetCode] 024. Swap Nodes in Pairs (Medium) (C++/Python)

[LeetCode] 023. Merge k Sorted Lists (Hard) (C++/Java/Python)

[LeetCode] 022. Generate Parentheses (Medium) (C++/Java/Python)

[LeetCode] 021. Merge Two Sorted Lists (Easy) (C++/Python)

[LeetCode] 020. Valid Parentheses (Easy) (C++/Java/Python)

[LeetCode] 019. Remove Nth Node From End of List (Easy) (C++/Python)

[LeetCode] 016. 3Sum Closest (Medium) (C++/Java/Python)

[LeetCode] 015. 3Sum (Medium) (C++/Java/Python)

[LeetCode] 013. Roman to Integer (Easy) (C++/Java/Python)

[LeetCode] 012. Integer to Roman (Medium) (C++/Java/Python)

[LeetCode] 011. Container With Most Water (Medium) (C++/Java/Python)

[LeetCode] 010. Regular Expression Matching (Hard) (C++/Java/Python)

[LeetCode] 009. Palindrome Number (Easy) (C++/Java/Python)

[LeetCode] 007. Reverse Integer (Easy) (C++/Java/Python)

[LeetCode] 007. Reverse Integer (Easy) (C++/Java/Python)

[LeetCode] 006. ZigZag Conversion (Easy) (C++/Java/Python)

[LeetCode] 005. Longest Palindromic Substring (Medium) (C++/Java/Python)

[LeetCode] 004. Median of Two Sorted Arrays (Hard) (C++/Java/Python)

[LeetCode] 003. Longest Substring Without Repeating Characters (Medium) (C++/Java/Python)

[LeetCode] 002. Add Two Numbers (Medium) (C++/Java/Python)

[LeetCode] 001. Two Sum (Medium) (C++/Java/Python)

LeetCode题解 || Two Sum问题

[LeetCode]Interleaving String

[LeetCode] Unique Binary Search Trees

LeetCode题解：Binary Tree Level Order Traversal

LeetCode题解：Reverse Integer （3种解法）

LeetCode题解：MinStack(三种解法)

LeetCode题解：Symmetric Tree（有4种解法）

LeetCode题解：Count and Say解法

LeetCode题解：Single Number最优解法

LeetCode题解——Edit Distance

HDU 1027 Ignatius and the Princess II 选择序列题解

LeetCode题解汇总（C++ Java Python，含题目翻译）

[置顶] 索(shen)引(keng)大全

LeetCode题解：Candy

LeetCode总结

[置顶] LeetCode总结

LeetCode题解： Valid Number

LeetCode题解：Implement strStr()

LeetCode题解：LRU Cache

LeetCode题解：Wildcard Matching