2016年3月18日
lintcode-medium-Digit Counts
摘要： Count the number of k's between 0 and n. k can be 0 - 9. if n=12, k=1 in [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12], we have FIVE 1's(1, 10, 11, 12) 阅读全文
posted @ 2016-03-18 13:09 哥布林工程师 阅读(118) 评论(0) 推荐(0)
lintcode-medium-Delete Digits
摘要： Given string A representative a positive integer which has N digits, remove any k digits of the number, the remaining digits are arranged according to 阅读全文
posted @ 2016-03-18 12:56 哥布林工程师 阅读(153) 评论(0) 推荐(0)
lintcode-medium-Decode Ways
摘要： A message containing letters from A-Z is being encoded to numbers using the following mapping: Given an encoded message containing digits, determine t 阅读全文
posted @ 2016-03-18 12:36 哥布林工程师 阅读(159) 评论(0) 推荐(0)
lintcode-medium-Count of Smaller Number
摘要： Give you an integer array (index from 0 to n-1, where n is the size of this array, value from 0 to 10000) and an query list. For each query, give you 阅读全文
posted @ 2016-03-18 08:18 哥布林工程师 阅读(177) 评论(0) 推荐(0)