Leetcode：Pascal's Triangle II
Pascal's Triangle II Given an index k, return the k th row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space?
這個網誌中的熱門文章
CSS w/ jQuery＃魔法陣
看到有人很無聊做了這個東西的 jQuery 版本，但我更無聊，因為 jQuery 版本佔用了很多資源，會把你的資源全部吃光光。 :P 於是乎我決定無聊的去改良這東西，變成為 CSS 版本！(歡呼聲)
Leetcode：Add digits
Add digits Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it. Follow up: Could you do it without any loop/recursion in O(1) runtime? Hint: A naive implementation of the above process is trivial. Could you come up with other methods?
留言
張貼留言