leetcode| ADD Digits

Source: Internet
Author: User

Given a non-negative integer num , repeatedly add all its digits until the result have only one digit.

For example:

Given num = 38 , the process is like: 3 + 8 = 11 , 1 + 1 = 2 . Since have only one 2 digit, return it.

Title: A glance, pure number +, add to single digit.

Idea: According to the previous implementation of the addition operation of the set, I think for a long, this is afraid to use the logical operation, with or not XOR or the same or ... After a long time on the paper calculation did not, began to doubt IQ, can not help to go online search, know to see such a string of numbers 123456789123456 .... Suddenly wake up, tube you which finally in accordance with the rules of the operation of a regular, what is the law, see you evenly divisible more than 9 what, so, the following:

public int adddigits (int num) {
Return (num-1)%9+1;

I feel this kind of problem with my sister to do the Olympic Games, you do not train of thought, there is no way, is to find the law.

leetcode| ADD Digits

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.