Algorithm: Reverse a Integer to an array with recursion

iteye_10992

于 2010-08-07 11:34:00 发布

阅读量93

点赞数

本文介绍了一种使用递归算法将整数反转并存储到数组中的方法。通过递归调用，每次处理数字的最后一位，并按从低位到高位的顺序填入数组，最终实现了整数的反转。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question:

Please reverse a Integer to an array with recursion. For example, there is a integer is 1234567890. After reverse, the integer should change to be 0987654321 .

Code:

// ConvertInteger.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <iostream.h> void reverse(int* storage, int num) { if(num>=10) reverse(storage+1 , num/10) ; // Cannot use stroage++, because storage is a const. // So, it cannot be ++ as l-value. *storage = num%10 ; } int main(int argc, char* argv[]) { int num = 1234567890 ; int storage[10] ; reverse(storage, num) ; for(int i=0 ; i<10 ; i++) { cout<<storage[i]<<" " ; } return 0; }