11 2015 档案

[LintCode] Count 1 in Binary
摘要：Count how many 1 in binary representation of a 32-bit integer. Example Given 32, return 1 Given 5, return 2 Given 1023, return 9 Count how many 1 in b 阅读全文

posted @ 2015-11-13 12:41 codingEskimo 阅读(139) 评论(0) 推荐(0)

String Replacement
摘要：public class Solution { /** * @param string: An array of Char * @param length: The true length of the string * @return: The true length... 阅读全文

posted @ 2015-11-13 11:24 codingEskimo 阅读(255) 评论(0) 推荐(0)

Fibonacci
摘要：1) Non-recursive: class Solution { /** * @param n: an integer * @return an integer f(n) */ public int fibonacci(int n) { // ... 阅读全文

posted @ 2015-11-13 10:49 codingEskimo 阅读(105) 评论(0) 推荐(0)

导航