LeetCode: missing num, count of 1s, roman to/from integer, decode ways, reverse integer
摘要：
Missing Number [Problem] [Solution2] sum: Time~O(n) Space~O(1) //overflow riskmissing = expected_sum - actual_sum = (0+n)(n+1)/2 - sum [Solution1] xor 阅读全文
posted @ 2016-09-12 05:27 gaoxingxing 阅读(204) 评论(0) 推荐(0) 编辑