LeetCode之Add Digits
生活随笔
收集整理的這篇文章主要介紹了
LeetCode之Add Digits
小編覺得挺不錯的,現在分享給大家,幫大家做個參考.
1、題目
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 like:?3 + 8 = 11,?1 + 1 = 2. Since?2?has only one digit, return it.
2、代碼實現
public class Solution {public int getAllSum(int val) {int sum = 0;while (val > 0) {sum += val % 10;val /= 10;}return sum;}public int addDigits(int num) {if (num <= 0) return 0;while (num >= 10) {num = getAllSum(num);}return num;}
} ?
?
總結
以上是生活随笔為你收集整理的LeetCode之Add Digits的全部內容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: LeetCode之Ransom Note
- 下一篇: LeetCode之Intersectio