From 4ffd15ef1c6458658098e6f0082af39fc7d8b951 Mon Sep 17 00:00:00 2001 From: CyC2018 <1029579233@qq.com> Date: Thu, 22 Feb 2018 16:56:17 +0800 Subject: [PATCH] auto commit --- notes/Leetcode 题解.md | 44 ++++++++++++++++++++++++++++-------------- 1 file changed, 29 insertions(+), 15 deletions(-) diff --git a/notes/Leetcode 题解.md b/notes/Leetcode 题解.md index d23a2e44..088eb1bd 100644 --- a/notes/Leetcode 题解.md +++ b/notes/Leetcode 题解.md @@ -658,13 +658,10 @@ public int findKthLargest(int[] nums, int k) { ### Í°ÅÅÐò - **ÕÒ³ö³öÏÖƵÂÊ×î¶àµÄ k ¸öÊý** [Leetcode : 347. Top K Frequent Elements (Medium)](https://leetcode.com/problems/top-k-frequent-elements/description/) -Í°ÅÅÐò - ```java public List topKFrequent(int[] nums, int k) { List ret = new ArrayList<>(); @@ -711,7 +708,6 @@ public List topKFrequent(int[] nums, int k) { - ¶ÓÁУºÓÃÀ´´æ´¢Ã¿Ò»ÂÖ±éÀúµÄ½Úµã - ±ê¼Ç£º¶ÔÓÚ±éÀú¹ýµÃ½Úµã£¬Ó¦¸Ã½«Ëü±ê¼Ç£¬·ÀÖ¹Öظ´±éÀú£» - **¼ÆËãÔÚÍø¸ñÖдÓÔ­µãµ½Ìض¨µãµÄ×î¶Ì·¾¶³¤¶È** ```html @@ -765,7 +761,6 @@ private class Position { - Õ»£ºÓÃÕ»À´±£´æµ±Ç°½ÚµãÐÅÏ¢£¬µ±±éÀúнڵ㷵»ØʱÄܹ»¼ÌÐø±éÀúµ±Ç°½Úµã¡£Ò²¿ÉÒÔʹÓõݹéÕ»¡£ - ±ê¼Ç£ººÍ BFS Ò»ÑùͬÑùÐèÒª¶ÔÒѾ­±éÀú¹ýµÃ½Úµã½øÐбê¼Ç¡£ - **²éÕÒ×î´óµÄÁ¬Í¨Ãæ»ý** [Leetcode : 695. Max Area of Island (Easy)](https://leetcode.com/problems/max-area-of-island/description/) @@ -826,7 +821,6 @@ public int findCircleNum(int[][] M) { dfs(M, i, hasFind); ret++; } - } return ret; } @@ -938,7 +932,7 @@ X O X X ÌâÄ¿ÃèÊö£ºÊ¹µÃ±» 'X' µÄ 'O' ת»»Îª 'X'¡£ -¿ÉÒÔÑ¡ÔñÏÈÌî³ä×îÍâ²à£¬Ê£ÏµľÍÊÇÀï²àÁË¡£ +ÏÈÌî³ä×îÍâ²à£¬Ê£ÏµľÍÊÇÀï²àÁË¡£ ```java private int[][] direction = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; @@ -992,7 +986,7 @@ Return: [[0, 4], [1, 3], [1, 4], [2, 2], [3, 0], [3, 1], [4, 0]] (positions with parentheses in above matrix). ``` -ÌâÄ¿ÃèÊö£º×ó±ßºÍÉϱßÊÇ̫ƽÑó£¬ÓұߺÍϱßÊÇ´óÎ÷Ñó£¬ÄÚ²¿µÄÊý×Ö´ú±íº£°Î£¬º£°Î¸ßµÄµØ·½µÄË®Äܹ»Á÷µ½µÍµÄµØ·½£¬Çó½âË®Äܹ»Á÷µ½Ì«Æ½ÑóºÍ´óÎ÷ÑóµÄËùÓеط½¡£ +ÌâÄ¿ÃèÊö£º×ó±ßºÍÉϱßÊÇ̫ƽÑó£¬ÓұߺÍϱßÊÇ´óÎ÷Ñó£¬ÄÚ²¿µÄÊý×Ö´ú±íº£°Î£¬º£°Î¸ßµÄµØ·½µÄË®Äܹ»Á÷µ½µÍµÄµØ·½£¬Çó½âË®Äܹ»Á÷µ½Ì«Æ½ÑóºÍ´óÎ÷ÑóµÄËùÓÐλÖᣠ```java private int m, n; @@ -1235,7 +1229,17 @@ private void doRestore(int k, String path, String s) { [Leetcode : 46. Permutations (Medium)](https://leetcode.com/problems/permutations/description/) -ÌâÄ¿ÃèÊö£ºÕÒ³öÒ»×éÊýµÄËùÓÐÅÅÁС£ +```html +[1,2,3] have the following permutations: +[ + [1,2,3], + [1,3,2], + [2,1,3], + [2,3,1], + [3,1,2], + [3,2,1] +] +``` ```java public List> permute(int[] nums) { @@ -1263,7 +1267,7 @@ private void backtracking(List permuteList, boolean[] visited, int[] nu } ``` -**²»ÄÜÖظ´µÄÅÅÁÐ** +**º¬ÓÐÏàͬԪËØÇóÅÅÁÐ** [Leetcode : 47. Permutations II (Medium)](https://leetcode.com/problems/permutations-ii/description/) @@ -1272,6 +1276,8 @@ private void backtracking(List permuteList, boolean[] visited, int[] nu [[1,1,2], [1,2,1], [2,1,1]] ``` +ÌâÄ¿ÃèÊö£ºÊý×éÔªËØ¿ÉÄܺ¬ÓÐÏàͬµÄÔªËØ£¬½øÐÐÅÅÁÐʱ¾ÍÓпÉÄܳöÏÈÖظ´µÄÅÅÁУ¬ÒªÇóÖظ´µÄÅÅÁÐÖ»·µ»ØÒ»¸ö¡£ + ÔÚʵÏÖÉÏ£¬ºÍ Permutations ²»Í¬µÄÊÇÒªÏÈÅÅÐò£¬È»ºóÔÚÌí¼ÓÒ»¸öÔªËØʱ£¬ÅжÏÕâ¸öÔªËØÊÇ·ñµÈÓÚÇ°Ò»¸öÔªËØ£¬Èç¹ûµÈÓÚ£¬²¢ÇÒÇ°Ò»¸öÔªËØ»¹Î´·ÃÎÊ£¬ÄÇô¾ÍÌø¹ýÕâ¸öÔªËØ¡£ ```java @@ -1306,7 +1312,17 @@ private void backtracking(List permuteList, boolean[] visited, int[] nu [Leetcode : 77. Combinations (Medium)](https://leetcode.com/problems/combinations/description/) -ÌâÄ¿ÃèÊö£ºÕÒ³ö´Ó 1 \~ n ÖÐÈ¡³ö k ¸öÔªËصÄËùÓпÉÄܵÄ×éºÏ¡£ +```html +If n = 4 and k = 2, a solution is: +[ + [2,4], + [3,4], + [2,3], + [1,2], + [1,3], + [1,4], +] +``` ```java public List> combine(int n, int k) { @@ -1341,7 +1357,6 @@ A solution set is: [[7],[2, 2, 3]] ``` - ```java private List> ret; @@ -1366,7 +1381,7 @@ A solution set is: } ``` -**²»ÄÜÖظ´µÄ×éºÏÇóºÍ** +**º¬ÓÐÏàͬԪËصÄÇó×éºÏÇóºÍ** [Leetcode : 40. Combination Sum II (Medium)](https://leetcode.com/problems/combination-sum-ii/description/) @@ -1409,7 +1424,6 @@ private void doCombination(int[] candidates, int target, int start, List