上一页 1 ··· 33 34 35 36 37
摘要: There are n coins with different value in a line. Two players take turns to take one or two coins from left side until there are no more coins left. T 阅读全文
posted @ 2017-06-03 07:08 Review->Improve 阅读(406) 评论(0) 推荐(0) 编辑
摘要: Given a set of words without duplicates, find all word squares you can build from them. A sequence of words forms a valid word square if the kth row a 阅读全文
posted @ 2017-06-02 13:09 Review->Improve 阅读(604) 评论(0) 推荐(0) 编辑
摘要: Given an integer n, return the number of trailing zeroes in n!. Example 1: Input: 3 Output: 0 Explanation: 3! = 6, no trailing zero. Example 2: Input: 阅读全文
posted @ 2017-06-01 23:22 Review->Improve 阅读(190) 评论(0) 推荐(0) 编辑
摘要: Write a function that add two numbers A and B. You should not use + or any arithmetic operators. There is no need to read data from standard input str 阅读全文
posted @ 2017-06-01 12:56 Review->Improve 阅读(213) 评论(0) 推荐(0) 编辑
摘要: This blog talks about using dynamic programming to solve the famous 0/1 back pack (knapsack) and its variant problems. BackPack I Given n items with s 阅读全文
posted @ 2017-06-01 12:08 Review->Improve 阅读(791) 评论(0) 推荐(0) 编辑
摘要: A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded messag 阅读全文
posted @ 2017-06-01 11:58 Review->Improve 阅读(375) 评论(0) 推荐(0) 编辑
上一页 1 ··· 33 34 35 36 37