Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
single_digit
//g++ 5.4.0 #include <iostream> using namespace std; int single_digit (int num) { static int sum = 0; if (num<10) { sum = sum + num; return sum; } sum = sum + num%10; single_digit(num/10); //return; } int main() { cout<<single_digit(34)<<endl; }
run
|
edit
|
history
|
help
1
complexity O(log(n))
by Muhammad Bilal, 3 years ago
Please
log in
to post a comment.
cccc
Pairs having sum equal to target
Handling new types without using RTTI
20201123
SpiralMatrix
How to get base class
Trapping rain water problem
Gauss 4x4 reducido
Breakfast Function
find duplicate in O(n)
stackse - search stackoverflow differently
complexity O(log(n))
by Muhammad Bilal, 3 years agoPlease log in to post a comment.