https://blog.youkuaiyun.com/PROMISEazh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/PROMISEa/article/details/146997572https://blog.youkuaiyun.com/PROMISEa/article/details/146997572PROMISEaFri, 04 Apr 2025 23:33:48 +0800了再往小取;1.确定dp数组以及下标的含义：dp[i]:总金额为i时，需要的最少硬币个数。3.dp数组如何初始化：dp[0]=0；1.确定dp数组以及下标的含义：dp[i]:0~i时的最长增序列。3.dp数组如何初始化：dp[0]=1；··类完全背包：取最少的物品装满背包。]]>https://blog.youkuaiyun.com/PROMISEa/article/details/146990546https://blog.youkuaiyun.com/PROMISEa/article/details/146990546PROMISEaFri, 04 Apr 2025 00:57:40 +0800ProjectSettings->ScripExecutionOrder 拖动位置调整顺序 Default Time值越小，越先执行 缺]]>https://blog.youkuaiyun.com/PROMISEa/article/details/146980429https://blog.youkuaiyun.com/PROMISEa/article/details/146980429PROMISEaThu, 03 Apr 2025 16:33:11 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146966717https://blog.youkuaiyun.com/PROMISEa/article/details/146966717PROMISEaWed, 02 Apr 2025 23:27:17 +0800target不继续return;递归根据 结果与数组的大小相等 结束纵向遍历。元素不能重复使用，used记录:使用过的-true。startIndex控制从数组的哪里开始取数。集合，无重复，顺序改变不增加子集个数。结果在每个节点里，每层递归都收集结果。数组的大小为树的深度。可重复加，选完仍可再选。代码随想录：回溯三部曲。]]>https://blog.youkuaiyun.com/PROMISEa/article/details/146915357https://blog.youkuaiyun.com/PROMISEa/article/details/146915357PROMISEaTue, 01 Apr 2025 23:32:47 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146885234https://blog.youkuaiyun.com/PROMISEa/article/details/146885234PROMISEaMon, 31 Mar 2025 23:57:08 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146816948https://blog.youkuaiyun.com/PROMISEa/article/details/146816948PROMISEaMon, 31 Mar 2025 17:12:42 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146717927https://blog.youkuaiyun.com/PROMISEa/article/details/146717927PROMISEaSat, 29 Mar 2025 23:49:59 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146642595https://blog.youkuaiyun.com/PROMISEa/article/details/146642595PROMISEaSat, 29 Mar 2025 19:26:38 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146635770https://blog.youkuaiyun.com/PROMISEa/article/details/146635770PROMISEaSat, 29 Mar 2025 00:51:43 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146607754https://blog.youkuaiyun.com/PROMISEa/article/details/146607754PROMISEaFri, 28 Mar 2025 23:58:39 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146603199https://blog.youkuaiyun.com/PROMISEa/article/details/146603199PROMISEaFri, 28 Mar 2025 17:22:40 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146580652https://blog.youkuaiyun.com/PROMISEa/article/details/146580652PROMISEaThu, 27 Mar 2025 23:43:21 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146544840https://blog.youkuaiyun.com/PROMISEa/article/details/146544840PROMISEaThu, 27 Mar 2025 00:33:01 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146526591https://blog.youkuaiyun.com/PROMISEa/article/details/146526591PROMISEaWed, 26 Mar 2025 23:46:11 +0800，------通过了？unordered_map是基于哈希表实现的，插入查找复杂度为O(1)·哈希表，存遍历过的数，target-新来的数b = 能与b凑成目标值的数a。map是基于红黑树实现的，插入查找复杂度为O(log n)··用vector存的话，查找又要遍历一遍，pass。·将 a 与哈希表中的数做判断，里面是否有 a。··用unordered_map。]]>https://blog.youkuaiyun.com/PROMISEa/article/details/146509541https://blog.youkuaiyun.com/PROMISEa/article/details/146509541PROMISEaTue, 25 Mar 2025 20:15:48 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146499427https://blog.youkuaiyun.com/PROMISEa/article/details/146499427PROMISEaTue, 25 Mar 2025 17:18:59 +0800next，慢在head，快的一次移动2步，慢的一次1步；··.conunt()看哈希表里有没有，有1，没0；·返回 由于循环后，当前指向了下一个，所以要返回cur_pre。·龟兔赛跑算法：兔子快，乌龟慢；]]>https://blog.youkuaiyun.com/PROMISEa/article/details/146474195https://blog.youkuaiyun.com/PROMISEa/article/details/146474195PROMISEaMon, 24 Mar 2025 14:35:33 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/146473356https://blog.youkuaiyun.com/PROMISEa/article/details/146473356PROMISEaMon, 24 Mar 2025 12:55:00 +0800https://blog.youkuaiyun.com/PROMISEa/article/details/123305263https://blog.youkuaiyun.com/PROMISEa/article/details/123305263PROMISEaSun, 06 Mar 2022 08:07:29 +0800