关于递归的理解

最新推荐文章于 2024-05-20 15:29:54 发布

爱莉希雅的老公

最新推荐文章于 2024-05-20 15:29:54 发布

阅读量131

点赞数 2

文章标签： c++ 算法蓝桥杯

本文链接：https://blog.csdn.net/m0_72793616/article/details/127347306

版权

原例：我们想明白递归函数到底是怎么运作的，所以想用递归来计算当给定一个正整数n(n < 16)时，求出n + (n-1)……+1的值,同时进行一些输出要求写一个int plus1(int a)形式的函数，在进入递归函数时，输出相关信息。在调用结束返回值前，输出相关信息。最后输出n + (n-1)……+1的值

输入：3

预期输出：

[plus1(3) output]Begin invoke plus1(3)
[plus1(3) output]I want to calculate plus1(3), require 3 and the value of plus1(2),so I need to invoke plus1(2)
[plus1(2) output]Begin invoke plus1(2)
[plus1(2) output]I want to calculate plus1(2), require 2 and the value of plus1(1),so I need to invoke plus1(1)
[plus1(1) output]Begin invoke plus1(1)
[plus1(1) output]return plus1(1) = 1
[plus1(2) output]I got the value of plus1(1), and plus it to 2then return3
[plus1(3) output]I got the value of plus1(2), and plus it to 3then return6
6

源代码：

#include <bits/stdc++.h>  //万能开头文件
using namespace std;

int plus1(int a) {      //定义函数  
	int b = 0;
	cout << "[plus1(" << a << ")output]Begin invoke plus1(" << a << ")" << endl;
	if (a == 1) {
		cout << "[plus1(1) output]return plus1(1) = 1" << endl;
		return 1;
	} else {
		cout << "[plus1(" << a << ") output]I want to calculate plus1(" << a << "), require " << a << " and the value of plus1("
		     << a - 1 << "),so I need to invoke plus1(" << a - 1 << ")" << endl;
		int c = plus1(a - 1);    //从两边向中间扩展输出
		b = a + c;
		cout << "[plus1(" << a << ") output]I got the value of plus1(" << a - 1 << "), and plus it to " << a << "then return" <<
		     b << endl;
		return b;  //函数返回值
	}
}

int main() {
	int n;
	cin >> n;
	cout << plus1(n);
	return 0;
}

理解思路及能掌握递归实质。