文章
[LintCode/LeetCode] Clone Graph [BFS/DFS]
ProblemCloneanundirectedgraph.Eachnodeinthegraphcontainsalabelandalistofitsneighbors.Weuseasaseparatorforeachnode,a
[LintCode] Subarray Sum
ProblemGivenanintegerarray,findasubarraywherethesumofnumbersiszero.Yourcodeshouldreturntheindexofthefirstnumberandthei
[LintCode/LeetCode] Two Sum
ProblemGivenanarrayofintegers,findtwonumberssuchthattheyadduptoaspecifictargetnumber.ThefunctiontwoSumshouldreturnindice
[LintCode] Anagrams
ProblemGivenanarrayofstrings,returnallgroupsofstringsthatareanagrams.NoticeAllinputswillbeinlowercaseExample
[LintCode] Permutation Index I & Permutation Index II
PermutationIndexProblemGivenapermutationwhichcontainsnorepeatednumber,finditsindexinallthepermutationsofthesenumber
[LintCode] Longest Substring Without Repeating Characters
ProblemGivenastring,findthelengthofthelongestsubstringwithoutrepeatingcharacters.ExampleForexample,thelongestsubstring
HashMap的几个要点
<blockquote<pJava基础系列</p</blockquoteJava的hashcode与equals方法(https://segmentfault.com/a/1190000004520827)Java类初始化顺序(https://segmentfa
[LintCode/LeetCode] Letter Combinations of a Phone Number
ProblemGivenadigitstring,returnallpossiblelettercombinationsthatthenumbercouldrepresent.Amappingofdigittoletters(justlikeon
[LeetCode/LintCode] Happy Number
ProblemWriteanalgorithmtodetermineifanumberishappy.Ahappynumberisanumberdefinedbythefollowingprocess:Startingwithanyposit
[LintCode] Number of Airplanes in the Sky
ProblemGivenanintervallistwhichareflyingandlandingtimeoftheflight.Howmanyairplanesareontheskyatmost?Note遍历List中的In
已加载文章中没有匹配内容,试试其他关键词或清空搜索。