摘要：
解法一： 一个几乎纯数学的解法 numbers: 1,...,9, 10, ..., 99, 100, ... 999, 1000 ,..., 9999, ... # of digits: 9 + 90*2 + 900*3 + 9000*4 + ... 利用这个公式可以很容易的求出来Nth digi 阅读全文
posted @ 2016-12-25 15:25
lettuan
阅读(170)
评论(0)
推荐(0)
摘要：
Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible. Note: The l 阅读全文
posted @ 2016-12-25 14:13
lettuan
阅读(275)
评论(0)
推荐(0)
摘要：
There is a list of sorted integers from 1 to n. Starting from left to right, remove the first number and every other number afterward until you reach 阅读全文
posted @ 2016-12-25 07:53
lettuan
阅读(767)
评论(0)
推荐(0)
摘要：
Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen. Follow up:Wha 阅读全文
posted @ 2016-12-25 04:15
lettuan
阅读(290)
评论(0)
推荐(0)
浙公网安备 33010602011771号