2013年11月17日

LeetCode Question Difficulty Distribution

摘要： IDQuestionDiffFreqData StructureAlgorithms1Two Sum25arraysortsetTwo Pointers2Add Two Numbers34linked listTwo PointersMath3Longest Substring Without Repeating Characters32stringTwo Pointershashtable4Median of Two Sorted Arrays53arrayBinary Search5Longest Palindromic Substring42string6ZigZag Conversio 阅读全文

posted @ 2013-11-17 06:32 Step-BY-Step 阅读(519) 评论(0) 推荐(0) 编辑

Pascal's Triangle II

摘要： Given an indexk, return thekthrow of the Pascal's triangle.For example, givenk= 3,Return[1,3,3,1].Note:Could you optimize your algorithm to use onlyO(k) extra space?A Formula for Any Entry in The TriangleIn fact there is a formula fromCombinationsfor working out the value at any place in Pascal& 阅读全文

posted @ 2013-11-17 05:15 Step-BY-Step 阅读(277) 评论(0) 推荐(0) 编辑

导航