摘要：
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; ... 阅读全文
摘要：
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 阅读全文