Write a recursive function digitsum (n), enter a non-negative integer, and return the sum of the numbers that comprise it

Source: Internet
Author: User

Title: Write a recursive function digitsum (n), enter a non-negative integer, return the sum of the numbers that make up it, for example, call digitsum (1729), you should return 1 +7+2+9, it's and is

#include <stdio.h>int digitsum (int num)//define Digitsum () function, return value is Int{if (num<10) return Num;elsereturn num%10+ Digitsum (NUM/10);} int main () {int ret = digitsum (1729);p rintf ("%d\n", ret); return 0;}

The results are as follows:


Write a recursive function digitsum (n), enter a non-negative integer, and return the sum of the numbers that comprise it

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.