首页 > 代码库 > Add Digits
Add Digits
Given a non-negative integer num
, repeatedly add all its digits until the result has only one digit.
Example
Given num
= 38.
The process is like: 3 + 8 = 11
, 1 + 1
= 2
. Since 2
has only one digit, return 2
.
也可数学直接求解 https://en.wikipedia.org/wiki/Digital_root
1 public class Solution { 2 /** 3 * @param num a non-negative integer 4 * @return one digit 5 */ 6 public int addDigits(int num) { 7 // Write your code here 8 while(num>=10){ 9 int tempSum = 0; 10 int temp = num; 11 while(temp>=10){ 12 tempSum += temp%10; 13 temp/=10; 14 } 15 num = temp+tempSum; 16 } 17 return num; 18 } 19 }
Add Digits
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。