代码随想录算法训练营第二十九天|回溯算法part05|* 491.递增子序列* 46.全排列* 47.全排列 II
491.递增子序列Non-decreasingSubsequences-LeetCode二维res一维pathvoidbacktracking(nums,startIndex)if(path.size()>1)res.add(path);Setused;//记录for(inti=startIndex;i>findSubsequences(int[]nums){List>res=newArrayLi