{"id":3076,"date":"2022-04-26T15:06:04","date_gmt":"2022-04-26T07:06:04","guid":{"rendered":"https:\/\/www.zeroheart.xyz\/wordpress\/?p=3076"},"modified":"2022-04-26T16:23:26","modified_gmt":"2022-04-26T08:23:26","slug":"%e7%ae%97%e6%b3%95%e5%9f%ba%e7%a1%80%e7%ac%ac10%e5%a4%a9","status":"publish","type":"post","link":"https:\/\/www.zeroheart.xyz\/wordpress\/?p=3076","title":{"rendered":"\u7b97\u6cd5\u57fa\u7840\u7b2c10\u5929"},"content":{"rendered":"\n<p><a href=\"https:\/\/leetcode-cn.com\/problems\/permutations-ii\/\">47. \u5168\u6392\u5217 II<\/a><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><br><em>\/**<br><\/em><em> 47. \u5168\u6392\u5217 II<br><\/em><em> \u7ed9\u5b9a\u4e00\u4e2a\u53ef\u5305\u542b\u91cd\u590d\u6570\u5b57\u7684\u5e8f\u5217 nums \uff0c\u6309\u4efb\u610f\u987a\u5e8f \u8fd4\u56de\u6240\u6709\u4e0d\u91cd\u590d\u7684\u5168\u6392\u5217\u3002<br><\/em><em><br><\/em><em><br><\/em><em><br><\/em><em> \u793a\u4f8b 1\uff1a<br><\/em><em><br><\/em><em> \u8f93\u5165\uff1anums = [1,1,2]<br><\/em><em> \u8f93\u51fa\uff1a<br><\/em><em> [[1,1,2],<br><\/em><em> [1,2,1],<br><\/em><em> [2,1,1]]<br><\/em><em> \u793a\u4f8b 2\uff1a<br><\/em><em><br><\/em><em> \u8f93\u5165\uff1anums = [1,2,3]<br><\/em><em> \u8f93\u51fa\uff1a[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]<br><\/em><em><br><\/em><em><br><\/em><em> \u63d0\u793a\uff1a<br><\/em><em><br><\/em><em> 1 &lt;= nums.length &lt;= 8<br><\/em><em> -10 &lt;= nums[i] &lt;= 10<br><\/em><em><br><\/em><em> * <\/em><strong><em>@author <\/em><\/strong><em>zeroheart<br><\/em><em> *<br><\/em><em> *\/<br><\/em>public class Question47 {<br>    private List&lt;List&lt;Integer&gt;&gt; res = new ArrayList&lt;&gt;();<br>    private List&lt;Integer&gt; path = new ArrayList&lt;&gt;();<br>    private boolean[] used;<br>    public List&lt;List&lt;Integer&gt;&gt; permuteUnique(int[] nums) {<br>        if(nums.length==0){<br>            res.add(path);<br>            return res;<br>        }<br>        Arrays.<em>sort<\/em>(nums);<br>        used = new boolean[nums.length];<br>        backtracting(nums);<br>        return res;<br>    }<br><br>    private void backtracting(int[] nums) {<br><br>        if(path.size() == nums.length){<br>            res.add(new ArrayList(path));<br>            return;<br>        }<br>        for(int i = 0; i&lt;nums.length; i++){<br>            \/\/ used[i - 1] == true\uff0c\u8bf4\u660e\u540c\u4e00\u6811\u652fnums[i - 1]\u4f7f\u7528\u8fc7<br>            \/\/ used[i - 1] == false\uff0c\u8bf4\u660e\u540c\u4e00\u6811\u5c42nums[i - 1]\u4f7f\u7528\u8fc7<br>            \/\/ \u5982\u679c\u540c\u4e00\u6811\u5c42nums[i - 1]\u4f7f\u7528\u8fc7\u5219\u76f4\u63a5\u8df3\u8fc7<br>            if(i&gt;=1 &amp;&amp; nums[i]==nums[i-1] &amp;&amp; used[i-1]==false){<br>                \/\/ \u5982\u679c\u5f53\u524d\u5143\u7d20\u548c\u524d\u4e00\u4e2a\u5143\u7d20\u76f8\u540c\uff0c\u800c\u4e14\u524d\u4e00\u4e2a\u5143\u7d20\u6ca1\u6709\u88ab\u8bbf\u95ee\uff0c\u8bf4\u660e\u524d\u4e00\u4e2a\u76f8\u540c\u7684\u5143\u7d20\u5728\u5f53\u524d\u5c42\u5df2\u7ecf\u88ab\u7528\u8fc7\u4e86<br>                continue;<br>            }<br>            \/\/\u5982\u679c\u540c\u2f00\u6811\u2f40nums[i]\u6ca1\u4f7f\u2f64\u8fc7\u5f00\u59cb\u5904\u7406<br>            if (used[i] == false) {<br>                path.add(nums[i]);<br>                used[i] = true;<br>                backtracting(nums);<br>                used[i] = false;<br>                path.remove(path.size() - 1);<br>            }<br>        }<br>    }<br>}<\/pre>\n\n\n\n<p><a href=\"https:\/\/leetcode-cn.com\/problems\/combination-sum\/\">39. \u7ec4\u5408\u603b\u548c<\/a><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><br><em>\/**<br><\/em><em> 39. \u7ec4\u5408\u603b\u548c<br><\/em><em> \u7ed9\u4f60\u4e00\u4e2a \u65e0\u91cd\u590d\u5143\u7d20 \u7684\u6574\u6570\u6570\u7ec4 candidates \u548c\u4e00\u4e2a\u76ee\u6807\u6574\u6570 target \uff0c\u627e\u51fa candidates \u4e2d\u53ef\u4ee5\u4f7f\u6570\u5b57\u548c\u4e3a\u76ee\u6807\u6570 target \u7684 \u6240\u6709 \u4e0d\u540c\u7ec4\u5408 \uff0c\u5e76\u4ee5\u5217\u8868\u5f62\u5f0f\u8fd4\u56de\u3002\u4f60\u53ef\u4ee5\u6309 \u4efb\u610f\u987a\u5e8f \u8fd4\u56de\u8fd9\u4e9b\u7ec4\u5408\u3002<br><\/em><em><br><\/em><em> candidates \u4e2d\u7684 \u540c\u4e00\u4e2a \u6570\u5b57\u53ef\u4ee5 \u65e0\u9650\u5236\u91cd\u590d\u88ab\u9009\u53d6 \u3002\u5982\u679c\u81f3\u5c11\u4e00\u4e2a\u6570\u5b57\u7684\u88ab\u9009\u6570\u91cf\u4e0d\u540c\uff0c\u5219\u4e24\u79cd\u7ec4\u5408\u662f\u4e0d\u540c\u7684\u3002<br><\/em><em><br><\/em><em> \u5bf9\u4e8e\u7ed9\u5b9a\u7684\u8f93\u5165\uff0c\u4fdd\u8bc1\u548c\u4e3a target \u7684\u4e0d\u540c\u7ec4\u5408\u6570\u5c11\u4e8e 150 \u4e2a\u3002<br><\/em><em><br><\/em><em><br><\/em><em><br><\/em><em> \u793a\u4f8b 1\uff1a<br><\/em><em><br><\/em><em> \u8f93\u5165\uff1acandidates = [2,3,6,7], target = 7<br><\/em><em> \u8f93\u51fa\uff1a[[2,2,3],[7]]<br><\/em><em> \u89e3\u91ca\uff1a<br><\/em><em> 2 \u548c 3 \u53ef\u4ee5\u5f62\u6210\u4e00\u7ec4\u5019\u9009\uff0c2 + 2 + 3 = 7 \u3002\u6ce8\u610f 2 \u53ef\u4ee5\u4f7f\u7528\u591a\u6b21\u3002<br><\/em><em> 7 \u4e5f\u662f\u4e00\u4e2a\u5019\u9009\uff0c 7 = 7 \u3002<br><\/em><em> \u4ec5\u6709\u8fd9\u4e24\u79cd\u7ec4\u5408\u3002<br><\/em><em> \u793a\u4f8b 2\uff1a<br><\/em><em><br><\/em><em> \u8f93\u5165: candidates = [2,3,5], target = 8<br><\/em><em> \u8f93\u51fa: [[2,2,2,2],[2,3,3],[3,5]]<br><\/em><em> \u793a\u4f8b 3\uff1a<br><\/em><em><br><\/em><em> \u8f93\u5165: candidates = [2], target = 1<br><\/em><em> \u8f93\u51fa: []<br><\/em><em><br><\/em><em><br><\/em><em> \u63d0\u793a\uff1a<br><\/em><em><br><\/em><em> 1 &lt;= candidates.length &lt;= 30<br><\/em><em> 1 &lt;= candidates[i] &lt;= 200<br><\/em><em> candidate \u4e2d\u7684\u6bcf\u4e2a\u5143\u7d20\u90fd \u4e92\u4e0d\u76f8\u540c<br><\/em><em> 1 &lt;= target &lt;= 500<br><\/em><em><br><\/em><em> * <\/em><strong><em>@author <\/em><\/strong><em>zeroheart<br><\/em><em> *<br><\/em><em> *\/<br><\/em>public class Question39 {<br>    private List&lt;List&lt;Integer&gt;&gt; res = new ArrayList&lt;&gt;();<br>    private List&lt;Integer&gt; path = new ArrayList&lt;&gt;();<br><br>    public List&lt;List&lt;Integer&gt;&gt; combinationSum(int[] candidates, int target) {<br>        Arrays.<em>sort<\/em>(candidates);<br>        backtracting(candidates, 0, target);<br>        return res;<br>    }<br><br>    private void backtracting(int[] nums, int x, int target) {<br>        if(target &lt; 0){<br>            return;<br>        }<br>        if(target == 0){<br>            res.add(new ArrayList(path));<br>            return;<br>        }<br>        for(int i = x; i&lt;nums.length; i++){<br>            path.add(nums[i]);<br>            backtracting(nums, i+1, target - nums[i]);<br>            path.remove(path.size() - 1);<br>        }<br>    }<br>}<\/pre>\n\n\n\n<p><a href=\"https:\/\/leetcode-cn.com\/problems\/combination-sum-ii\/\">40. \u7ec4\u5408\u603b\u548c II<\/a><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><br><em>\/**<br><\/em><em> 40. \u7ec4\u5408\u603b\u548c II<br><\/em><em> \u7ed9\u5b9a\u4e00\u4e2a\u5019\u9009\u4eba\u7f16\u53f7\u7684\u96c6\u5408 candidates \u548c\u4e00\u4e2a\u76ee\u6807\u6570 target \uff0c\u627e\u51fa candidates \u4e2d\u6240\u6709\u53ef\u4ee5\u4f7f\u6570\u5b57\u548c\u4e3a target \u7684\u7ec4\u5408\u3002<br><\/em><em><br><\/em><em> candidates \u4e2d\u7684\u6bcf\u4e2a\u6570\u5b57\u5728\u6bcf\u4e2a\u7ec4\u5408\u4e2d\u53ea\u80fd\u4f7f\u7528 \u4e00\u6b21 \u3002<br><\/em><em><br><\/em><em> \u6ce8\u610f\uff1a\u89e3\u96c6\u4e0d\u80fd\u5305\u542b\u91cd\u590d\u7684\u7ec4\u5408\u3002<br><\/em><em><br><\/em><em><br><\/em><em><br><\/em><em> \u793a\u4f8b 1:<br><\/em><em><br><\/em><em> \u8f93\u5165: candidates = [10,1,2,7,6,1,5], target = 8,<br><\/em><em> \u8f93\u51fa:<br><\/em><em> [<br><\/em><em> [1,1,6],<br><\/em><em> [1,2,5],<br><\/em><em> [1,7],<br><\/em><em> [2,6]<br><\/em><em> ]<br><\/em><em> \u793a\u4f8b 2:<br><\/em><em><br><\/em><em> \u8f93\u5165: candidates = [2,5,2,1,2], target = 5,<br><\/em><em> \u8f93\u51fa:<br><\/em><em> [<br><\/em><em> [1,2,2],<br><\/em><em> [5]<br><\/em><em> ]<br><\/em><em><br><\/em><em><br><\/em><em> \u63d0\u793a:<br><\/em><em><br><\/em><em> 1 &lt;= candidates.length &lt;= 100<br><\/em><em> 1 &lt;= candidates[i] &lt;= 50<br><\/em><em> 1 &lt;= target &lt;= 30<br><\/em><em><br><\/em><em> * <\/em><strong><em>@author <\/em><\/strong><em>zeroheart<br><\/em><em> *<br><\/em><em> *\/<br><\/em>public class Question40 {<br>    private List&lt;List&lt;Integer&gt;&gt; res = new ArrayList&lt;&gt;();<br>    private List&lt;Integer&gt; path = new ArrayList&lt;&gt;();<br>    private boolean[] used;<br>    public List&lt;List&lt;Integer&gt;&gt; combinationSum2(int[] candidates, int target) {<br>        used = new boolean[candidates.length];<br>        Arrays.<em>sort<\/em>(candidates);<br>        backtracting(candidates, 0, target);<br>        return res;<br>    }<br><br>    private void backtracting(int[] nums, int x, int target) {<br>        if(target &lt; 0){<br>            return;<br>        }<br>        if(target == 0){<br>            res.add(new ArrayList(path));<br>            return;<br>        }<br>        for(int i = x; i&lt;nums.length; i++){<br>            if(i&gt;0 &amp;&amp; nums[i] == nums[i-1] &amp;&amp; used[i-1] == false) {<br>                continue;<br>            }<br>            used[i] = true;<br>            path.add(nums[i]);<br>            backtracting(nums, i+1, target - nums[i]);<br>            path.remove(path.size() - 1);<br>            used[i] = false;<br>        }<br>    }<br>}<\/pre>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>47. \u5168\u6392\u5217 II \/** 47. \u5168\u6392\u5217 II \u7ed9\u5b9a\u4e00\u4e2a\u53ef\u5305\u542b\u91cd\u590d\u6570\u5b57\u7684\u5e8f\u5217 nums \uff0c\u6309\u4efb\u610f\u987a\u5e8f \u8fd4\u56de [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[155],"tags":[176],"_links":{"self":[{"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/3076"}],"collection":[{"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3076"}],"version-history":[{"count":4,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/3076\/revisions"}],"predecessor-version":[{"id":3080,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/3076\/revisions\/3080"}],"wp:attachment":[{"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3076"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=3076"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=3076"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}