给定一个数字,求其数字之和。 例子:
null
Input : n = 687Output : 21Input : n = 12Output : 3
1.迭代:
JAVA
// Java program to compute // sum of digits in number. import java.io.*; class GFG { /* Function to get sum of digits */ static int getSum( int n) { int sum = 0 ; while (n != 0 ) { sum = sum + n % 10 ; n = n/ 10 ; } return sum; } // Driver program public static void main(String[] args) { int n = 687 ; System.out.println(getSum(n)); } } // This code is contributed by Gitanjali |
时间复杂性: O(|n |)
辅助空间: O(1)
如何在单行中计算?
JAVA
// Java program to compute // sum of digits in number. import java.io.*; class GFG { /* Function to get sum of digits */ static int getSum( int n) { int sum; /* Single line that calculates sum */ for (sum = 0 ; n > 0 ; sum += n % 10 , n /= 10 ); return sum; } // Driver code public static void main(String[] args) { int n = 687 ; System.out.println(getSum(n)); } } // This code is contributed by Gitanjali |
时间复杂性: O(|n |)
辅助空间: O(1)
2.递归
JAVA
// Java program to compute // sum of digits in number. import java.io.*; class GFG { /* Function to get sum of digits */ static int sumDigits( int no) { return no == 0 ? 0 : no% 10 + sumDigits(no/ 10 ) ; } // Driver code public static void main(String[] args) { int n = 687 ; System.out.println(sumDigits(n)); } } // This code is contributed by Gitanjali |
时间复杂性: O(原木) 10 n)
辅助空间: O(原木) 10 n)
请参阅完整的文章 对给定数字的数字求和的程序 更多细节!
© 版权声明
文章版权归作者所有,未经允许请勿转载。
THE END