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

添加 0491.递增子序列.md C语言版本注释

Browse Source
This commit is contained in:
ArthurP
2021-09-27 20:02:02 +01:00
parent b7589fa1a4
commit d39a7287a2
1 changed files with 9 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
problems/0491.递增子序列.md
View File

@ -320,6 +320,7 @@ int pathTop;
int** ans; int** ans;
int ansTop; int ansTop;
int* length; int* length;
//将当前path中的内容复制到ans中
void copy() { void copy() {
int* tempPath = (int*)malloc(sizeof(int) * pathTop); int* tempPath = (int*)malloc(sizeof(int) * pathTop);
memcpy(tempPath, path, pathTop * sizeof(int)); memcpy(tempPath, path, pathTop * sizeof(int));
@ -327,6 +328,7 @@ void copy() {
ans[ansTop++] = tempPath; ans[ansTop++] = tempPath;
} }
//查找uset中是否存在值为key的元素
int find(int* uset, int usetSize, int key) { int find(int* uset, int usetSize, int key) {
int i; int i;
for(i = 0; i < usetSize; i++) { for(i = 0; i < usetSize; i++) {
@ -337,6 +339,7 @@ int find(int* uset, int usetSize, int key) {
} }
void backTracking(int* nums, int numsSize, int startIndex) { void backTracking(int* nums, int numsSize, int startIndex) {
//当path中元素大于1个时，将path拷贝到ans中
if(pathTop > 1) { if(pathTop > 1) {
copy(); copy();
} }
@ -344,16 +347,21 @@ void backTracking(int* nums, int numsSize, int startIndex) {
int usetTop = 0; int usetTop = 0;
int i; int i;
for(i = startIndex; i < numsSize; i++) { for(i = startIndex; i < numsSize; i++) {
//若当前元素小于path中最后一位元素 || 在树的同一层找到了相同的元素，则continue
if((pathTop > 0 && nums[i] < path[pathTop - 1]) || find(uset, usetTop, nums[i])) if((pathTop > 0 && nums[i] < path[pathTop - 1]) || find(uset, usetTop, nums[i]))
continue; continue;
//将当前元素放入uset
uset[usetTop++] = nums[i]; uset[usetTop++] = nums[i];
//将当前元素放入path
path[pathTop++] = nums[i]; path[pathTop++] = nums[i];
backTracking(nums, numsSize, i + 1); backTracking(nums, numsSize, i + 1);
//回溯
pathTop--; pathTop--;
} }
} }
int** findSubsequences(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){ int** findSubsequences(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){
//辅助数组初始化
path = (int*)malloc(sizeof(int) * numsSize); path = (int*)malloc(sizeof(int) * numsSize);
ans = (int**)malloc(sizeof(int*) * 33000); ans = (int**)malloc(sizeof(int*) * 33000);
length = (int*)malloc(sizeof(int*) * 33000); length = (int*)malloc(sizeof(int*) * 33000);
@ -361,6 +369,7 @@ int** findSubsequences(int* nums, int numsSize, int* returnSize, int** returnCol
backTracking(nums, numsSize, 0); backTracking(nums, numsSize, 0);
//设置数组中返回元素个数，以及每个一维数组的长度
*returnSize = ansTop; *returnSize = ansTop;
*returnColumnSizes = (int*)malloc(sizeof(int) * ansTop); *returnColumnSizes = (int*)malloc(sizeof(int) * ansTop);
int i; int i;