{"id":2623,"date":"2022-04-07T22:40:21","date_gmt":"2022-04-07T14:40:21","guid":{"rendered":"https:\/\/www.zeroheart.xyz\/wordpress\/?p=2623"},"modified":"2022-04-07T23:54:24","modified_gmt":"2022-04-07T15:54:24","slug":"%e7%ae%97%e6%b3%95%e5%85%a5%e9%97%a8%e7%ac%ac11%e5%a4%a9","status":"publish","type":"post","link":"https:\/\/www.zeroheart.xyz\/wordpress\/?p=2623","title":{"rendered":"\u7b97\u6cd5\u5165\u95e8\u7b2c11\u5929"},"content":{"rendered":"\n<p>\u5f00\u59cb\u63a5\u89e6\u5230\u56de\u6eaf\u7b97\u6cd5\uff0c\u8fd9\u73a9\u610f\u4e5f\u662f\u6709\u5957\u8def\u7684\uff0c\u4e3b\u8981\u89e3\u51b3\u4e00\u4e9b\u6392\u5217\u7ec4\u5408\u4e4b\u7c7b\u7684\u95ee\u9898\uff0c\u56de\u6eaf\u662f\u66b4\u529b\u641c\u7d22\u3002<\/p>\n\n\n\n<p><a href=\"https:\/\/leetcode-cn.com\/problems\/combinations\/\">77. \u7ec4\u5408<\/a><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><em>\/**\n 77. \u7ec4\u5408\n \u7ed9\u5b9a\u4e24\u4e2a\u6574\u6570 n \u548c k\uff0c\u8fd4\u56de\u8303\u56f4 [1, n] \u4e2d\u6240\u6709\u53ef\u80fd\u7684 k \u4e2a\u6570\u7684\u7ec4\u5408\u3002\n\n \u4f60\u53ef\u4ee5\u6309 \u4efb\u4f55\u987a\u5e8f \u8fd4\u56de\u7b54\u6848\u3002\n\n\n\n \u793a\u4f8b 1\uff1a\n\n \u8f93\u5165\uff1an = 4, k = 2\n \u8f93\u51fa\uff1a\n [\n [2,4],\n [3,4],\n [2,3],\n [1,2],\n [1,3],\n [1,4],\n ]\n \u793a\u4f8b 2\uff1a\n\n \u8f93\u5165\uff1an = 1, k = 1\n \u8f93\u51fa\uff1a[[1]]\n\n\n \u63d0\u793a\uff1a\n\n 1 &lt;= n &lt;= 20\n 1 &lt;= k &lt;= n\n\n * <\/em><strong><em>@author <\/em><\/strong><em>zeroheart\n * <\/em><strong><em>@since <\/em><\/strong><em>2022\/4\/4\n *\/\n<\/em>public class Question77 {\n    List&lt;List&lt;Integer&gt;&gt; res = new ArrayList();\n    List&lt;Integer&gt; path = new ArrayList();\n    public List&lt;List&lt;Integer&gt;&gt; combine(int n, int k) {\n        backtracing(1, n, k);\n        return res;\n    }\n\n    private void backtracing(int start, int n, int k) {\n        if(path.size() == k){\n            res.add(new ArrayList&lt;&gt;(path));\n            System.<em>out<\/em>.println(path);\n            return;\n        }\n        for(int i = start; i&lt;=n; i++){\n            path.add(i);\n            backtracing(i+1, n, k);\n            path.remove(path.size() - 1);\n        }\n\n    }\n\n}<\/pre>\n\n\n\n<p><a href=\"https:\/\/leetcode-cn.com\/problems\/permutations\/\">46. \u5168\u6392\u5217<\/a><\/p>\n\n\n\n<p>\u8fd9\u9898\u548c\u4e0a\u9762\u7684\u7ec4\u5408\u662f\u540c\u4e00\u4e2a\u5957\u8def\uff0c\u4e0d\u8fc7\u5168\u6392\u5217\u4e0d\u7ba1\u987a\u5e8f\uff0c\u6240\u4ee5\u4ece0\u5f00\u59cb\uff0c\u5e76\u4e14\u5982\u679c\u662f\u8bbf\u95ee\u7684\u8282\u70b9\uff0c\u4e0d\u4f1a\u91cd\u590d\u6dfb\u52a0\uff0c\u4e0d\u4f1a\u51fa\u73b0111\uff0c112\u8fd9\u6837\u7684\u6392\u5217<\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><br><em>\/**<br><\/em><em> 46. \u5168\u6392\u5217<br><\/em><em> \u7ed9\u5b9a\u4e00\u4e2a\u4e0d\u542b\u91cd\u590d\u6570\u5b57\u7684\u6570\u7ec4 nums \uff0c\u8fd4\u56de\u5176 \u6240\u6709\u53ef\u80fd\u7684\u5168\u6392\u5217 \u3002\u4f60\u53ef\u4ee5 \u6309\u4efb\u610f\u987a\u5e8f \u8fd4\u56de\u7b54\u6848\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,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> \u793a\u4f8b 2\uff1a<br><\/em><em><br><\/em><em> \u8f93\u5165\uff1anums = [0,1]<br><\/em><em> \u8f93\u51fa\uff1a[[0,1],[1,0]]<br><\/em><em> \u793a\u4f8b 3\uff1a<br><\/em><em><br><\/em><em> \u8f93\u5165\uff1anums = [1]<br><\/em><em> \u8f93\u51fa\uff1a[[1]]<br><\/em><em><br><\/em><em><br><\/em><em> \u63d0\u793a\uff1a<br><\/em><em><br><\/em><em> 1 &lt;= nums.length &lt;= 6<br><\/em><em> -10 &lt;= nums[i] &lt;= 10<br><\/em><em> nums \u4e2d\u7684\u6240\u6709\u6574\u6570 \u4e92\u4e0d\u76f8\u540c<br><\/em><em><br><\/em><em> * <\/em><strong><em>@author <\/em><\/strong><em>zeroheart<br><\/em><em> * <\/em><strong><em>@since <\/em><\/strong><em>2022\/4\/4<br><\/em><em> *\/<br><\/em>public class Question46 {<br>    List&lt;List&lt;Integer&gt;&gt; res = new ArrayList();<br>    List&lt;Integer&gt; path = new ArrayList();<br>    boolean[] visited = null;<br>    public List&lt;List&lt;Integer&gt;&gt; permute(int[] nums) {<br>        int k = nums.length;<br>        visited = new boolean[nums.length];<br>        backtracing(nums, k);<br>        return res;<br>    }<br><br>    private void backtracing(int[] nums, int k) {<br>        if(path.size() == k){<br>            res.add(new ArrayList(path));<br>            System.<em>out<\/em>.println(path);<br>            return;<br>        }<br><br>        for(int j = 0; j &lt; k; j++){<br>            if(visited[j]) continue;<br>            visited[j] = true;<br>            path.add(nums[j]);<br>            backtracing(nums, k);<br>            visited[j] = false;<br>            path.remove(path.size() - 1);<br>        }<br><br><br>    }<br><br><br>    public static void main(String[] args) {<br>        new Question46().permute(new int[]{1,2,3});<br>    }<br><br><br>}<\/pre>\n\n\n\n<p><a href=\"https:\/\/leetcode-cn.com\/problems\/letter-case-permutation\/\">784. \u5b57\u6bcd\u5927\u5c0f\u5199\u5168\u6392\u5217<\/a><\/p>\n\n\n\n<p>\u8fd9\u9898\u662f\u4e0d\u6539\u53d8\u987a\u5e8f\u7684\uff0c\u6240\u4ee5\u4e0d\u9700\u8981\u5faa\u73af\u5904\u7406\uff0c\u4e5f\u4e0d\u9700\u8981\u5f39\u51fa\u6700\u540e\u7684\u5b57\u6bcd\uff0c\u56e0\u4e3a\u957f\u5ea6\u603b\u662f\u4e0d\u53d8\uff0c\u53ea\u662f\u66ff\u6362\u5176\u4e2d\u7684\u5927\u5c0f\u5199\u3002<\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><br><em>\/**<br><\/em><em> 784. \u5b57\u6bcd\u5927\u5c0f\u5199\u5168\u6392\u5217<br><\/em><em> \u7ed9\u5b9a\u4e00\u4e2a\u5b57\u7b26\u4e32 s \uff0c\u901a\u8fc7\u5c06\u5b57\u7b26\u4e32 s \u4e2d\u7684\u6bcf\u4e2a\u5b57\u6bcd\u8f6c\u53d8\u5927\u5c0f\u5199\uff0c\u6211\u4eec\u53ef\u4ee5\u83b7\u5f97\u4e00\u4e2a\u65b0\u7684\u5b57\u7b26\u4e32\u3002<br><\/em><em><br><\/em><em> \u8fd4\u56de \u6240\u6709\u53ef\u80fd\u5f97\u5230\u7684\u5b57\u7b26\u4e32\u96c6\u5408 \u3002\u4ee5 \u4efb\u610f\u987a\u5e8f \u8fd4\u56de\u8f93\u51fa\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\uff1as = \"a1b2\"<br><\/em><em> \u8f93\u51fa\uff1a[\"a1b2\", \"a1B2\", \"A1b2\", \"A1B2\"]<br><\/em><em> \u793a\u4f8b 2:<br><\/em><em><br><\/em><em> \u8f93\u5165: s = \"3z4\"<br><\/em><em> \u8f93\u51fa: [\"3z4\",\"3Z4\"]<br><\/em><em><br><\/em><em><br><\/em><em> \u63d0\u793a:<br><\/em><em><br><\/em><em> 1 &lt;= s.length &lt;= 12<br><\/em><em> s \u7531\u5c0f\u5199\u82f1\u6587\u5b57\u6bcd\u3001\u5927\u5199\u82f1\u6587\u5b57\u6bcd\u548c\u6570\u5b57\u7ec4\u6210<br><\/em><em><br><\/em><em><br><\/em><em> * <\/em><strong><em>@author <\/em><\/strong><em>zeroheart<br><\/em><em> * <\/em><strong><em>@since <\/em><\/strong><em>2022\/4\/4<br><\/em><em> *\/<br><\/em>public class Question784 {<br>    List&lt;String&gt; res = new ArrayList();<br>    public List&lt;String&gt; letterCasePermutation(String s) {<br>        char[] chars = s.toCharArray();<br>        backtracing(chars, 0);<br>        return res;<br>    }<br><br>    private void backtracing(char[] chars, int idx) {<br>        if(idx == chars.length){<br>            String s = new String(chars);<br>            res.add(s);<br>            System.<em>out<\/em>.println(s);<br>            return;<br>        }<br><br>        if(!Character.<em>isDigit<\/em>(chars[idx])) {<br>            char aChar = chars[idx];<br>            chars[idx] = Character.<em>toLowerCase<\/em>(aChar);<br>            backtracing(chars, idx + 1);<br>            chars[idx] = Character.<em>toUpperCase<\/em>(aChar);<br>            backtracing(chars, idx + 1);<br>        }<br>        backtracing(chars, idx + 1);<br>    }<br><br><br>    public static void main(String[] args) {<br>    }<br><br><br>}<\/pre>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u5f00\u59cb\u63a5\u89e6\u5230\u56de\u6eaf\u7b97\u6cd5\uff0c\u8fd9\u73a9\u610f\u4e5f\u662f\u6709\u5957\u8def\u7684\uff0c\u4e3b\u8981\u89e3\u51b3\u4e00\u4e9b\u6392\u5217\u7ec4\u5408\u4e4b\u7c7b\u7684\u95ee\u9898\uff0c\u56de\u6eaf\u662f\u66b4\u529b\u641c\u7d22\u3002 77. \u7ec4\u5408 \/** [&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,177],"_links":{"self":[{"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/2623"}],"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=2623"}],"version-history":[{"count":11,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/2623\/revisions"}],"predecessor-version":[{"id":2636,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/2623\/revisions\/2636"}],"wp:attachment":[{"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2623"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2623"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.zeroheart.xyz\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2623"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}