Problems in Nankai district (4)

Question requirement: judge whether a number is a return number. For example, if the number is 98789, the number is 98789, and the number is 98789, the number is as follows: [cpp]/* the overall idea is to reverse all the numbers. Compare the original number with the reverse number to see if they are equal. If they are equal, the number is the number of the input. */Int jsValue (long n) {long tem = n; // place the n value in the Temporary Variable tem long I; // I stores the reversed number in I = tem % 10; // put the original number of digits in I first www.2cto.com tem = tem/10; // remove the original number of digits, generate a new number // gradually remove each bit of tem. As long as the tem still has a bit (that is, the tem is not equal to zero), the loop will continue while (tem) {I = I * 10 + tem % 10; // store the tem bit in I again, and the original single digit is changed to ten digits, the original ten digits will be changed to a hundred digits tem = tem/10; // remove the digits that have been placed in I in the tem} if (I = n) // determine whether the number after reversal is equal to the original number. return 1; else return 0 ;}