algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-24 00:57:05 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update

Browse Source
This commit is contained in:
programmercarl
2023-03-29 11:34:59 +08:00
parent 3dda10b12f
commit dad45d599b
4 changed files with 11 additions and 157 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
problems/前序/通过一道面试题目，讲一讲递归算法的时间复杂度！.md
View File

@ -54,9 +54,9 @@ int function2(int x, int n) {
```CPP
int function3(int x, int n) {
if (n == 0) {
return 1;
}
if (n == 0) return 1;
if (n == 1) return x;
if (n % 2 == 1) {
return function3(x, n / 2) * function3(x, n / 2)*x;
}
@ -93,9 +93,8 @@ int function3(int x, int n) {
```CPP
int function4(int x, int n) {
if (n == 0) {
return 1;
}
if (n == 0) return 1;
if (n == 1) return x;
int t = function4(x, n / 2);// 这里相对于function3，是把这个递归操作抽取出来
if (n % 2 == 1) {
return t * t * x;
@ -124,9 +123,8 @@ int function4(int x, int n) {
```CPP
int function3(int x, int n) {
if (n == 0) {
return 1;
}
if (n == 0) return 1;
if (n == 1) return x;
if (n % 2 == 1) {
return function3(x, n / 2) * function3(x, n / 2)*x;
}