2017年7月9日
剑指Offer-- 丑数
摘要： class Solution { public: int GetUglyNumber_Solution(int index) { int res = 0, i = 1,tmp; int arr[index]; int ptrto2 = 0, ptrto3 = 0, ptrto5 = 0; arr[0] = 1; ... 阅读全文
posted @ 2017-07-09 22:17 爱简单的Paul 阅读(146) 评论(0) 推荐(0)
Leetcode -- 258 数位相加
摘要： 258. Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is 阅读全文
posted @ 2017-07-09 21:23 爱简单的Paul 阅读(245) 评论(0) 推荐(0)