258.Add Digits

女爷i 2022-06-09 03:54 259阅读 0赞 
  1. /*
  2.  Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
  4. For example:
  6. Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.
  8. Follow up:
  9. Could you do it without any loop/recursion in O(1) runtime? 
  10. */
  11. int a[101];
  12. int addDigits(int num) {
  13.     int i;
  14.     while(num>=10)
  15.     {
  16.         num = getArray(num);//直到num小于10才返回
  17.     }
  18.     return num;
  19. }
  20. int getArray(int total)
  21. {
  22.     int i,count = 0, res = 0;
  23.     for(i = 0; total != 0 ; i++)//将数字分配到数组中
  24.     {
  25.         a[i] = total % 10;
  26.         total = total / 10;
  27.         count++;
  28.     }
  29.     for(i = 0 ; i < count ; i++)//累加起来
  30.         res = res + a[i];
  31.     return res;
  32. }

发表评论

表情：
评论列表 （有 0 条评论，259人围观）

还没有评论，来说两句吧...

相关阅读