Leetcode Add Digits
来源:互联网 发布:微商和淘宝哪个挣钱 编辑:程序博客网 时间:2024/06/08 05:04
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.
Difficulty: Easy
public class Solution { public int addDigits(int num) { if(num <= 9) return num; int ans = 0; while(num != 0){ ans += num%10; num = num/10; } return addDigits(ans); }}
0 0
- [leetcode][math] Add Digits
- [leetcode] Add Digits
- 【leetcode】Add Digits【java】
- Leetcode: Add Digits
- LeetCode Add Digits
- [LeetCode] Add Digits
- leetcode 258: Add Digits
- LeetCode题解:Add Digits
- leetcode: Add Digits
- 258Add Digits - LeetCode
- leetCode #258 Add Digits
- [LeetCode 258] Add Digits
- LeetCode: Add Digits
- LeetCode:Add Digits
- leetcode--add digits
- leetcode Add Digits
- leetcode--Add Digits
- leetcode Add Digits
- Leetcode Odd Even Linked List
- Leetcode Reorder List
- Leetcode Palindrome Number
- 大笨鹰
- Leetcode Invert Binary Tree
- Leetcode Add Digits
- Leetcode Count and Say
- Leetcode Container With Most Water
- Leetcode Remove Element
- Leetcode Remove Duplicates from Sorted Array
- Leetcode Rotate Array
- Leetcode Merge Sorted Array
- Leetcode Find Minimum in Rotated Sorted Array
- Leetcode Reverse String