{
  "question_id": 227612,
  "question_title": "用递归实现任意的正整数按反序输出",
  "question_content": "编写一个递归函数，将任意的正整数按反序输出。例如，输入\"12345\"输出\"54321\"",
  "difficulty": "简单",
  "answer_id": 192049,
  "answer_content": "\n\n```\n #include <iostream>\nusing namespace std;\n\nvoid revert(int n)\n{\n    if ( n>= 0 && n<= 9 )\n    {\n        cout<<n;\n    }\n    else\n    {\n        cout<<n % 10;\n        revert(n/10);\n    }   \n}\n\nint main()\n{\n    int n = 12345 ;\n    revert(n);\n}\n```\n另外给你个图你就明白用递归怎么实现了\n![图片说明](https://img-ask.csdn.net/upload/201512/20/1450618367_788393.png)\n",
  "tag_name": "c++",
  "cpp": " #include <iostream>\nusing namespace std;\nvoid revert(int n)\n{\n\tif ( n>= 0 && n<= 9 )\n\t{\n\t\tcout<<n;\n\t}\n\telse\n\t{\n\t\tcout<<n % 10;\n\t\trevert(n/10);\n\t}   \n}\nint main()\n{\n\tint n = 12345 ;\n\trevert(n);\n}",
  "topic_link": "https://bbs.csdn.net/topics/600469854",
  "status": 1,
  "keywords": "算法高阶,计算几何学,算法问题选编,确定任意一对线段是否相交",
  "license": "csdn.net",
  "notebook": {
    "cpp": "https://codechina.csdn.net/csdn/csdn-daily-code/-/jupyter/master/data/notebook/answer/ipynb/cpp/79.ipynb?type=file"
  },
  "notebook_enable": 1,
  "author": "fulei1360"
}