From d0051e51a45d6b964be7377ee18256ce5b0add67 Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sat, 27 Apr 2019 19:25:50 +0800 Subject: [PATCH 01/12] Create 242_12 --- Week_02/id_12/242_12 | 36 ++++++++++++++++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 Week_02/id_12/242_12 diff --git a/Week_02/id_12/242_12 b/Week_02/id_12/242_12 new file mode 100644 index 00000000..28529939 --- /dev/null +++ b/Week_02/id_12/242_12 @@ -0,0 +1,36 @@ +class Solution { + + /** + * @param String $s + * @param String $t + * @return Boolean + */ + function isAnagram($s, $t) { + $ttemp = $t; + $sLen = strlen($s); + $tLen = strlen($t); + if($sLen != $tLen){ + return false; + } + $sbool = $tbool = true; + for($i=0;$i<$sLen;$i++){ + if(stripos($t, $s[$i]) === false){ + $sbool = false; + break; + } + $t = preg_replace("/$s[$i]/", '', $t, 1); + } + for($j=0;$j<$tLen;$j++){ + if(stripos($s, $ttemp[$j]) === false){ + $tbool = false; + break; + } + $s = preg_replace("/$ttemp[$j]/", '', $s, 1); + } + if($sbool && $tbool){ + return true; + }else{ + return false; + } + } +} From cac2b1195c6c00aac6c3b8deb467cf7d5086e887 Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sat, 27 Apr 2019 21:48:55 +0800 Subject: [PATCH 02/12] Create 671_12 --- Week_02/id_12/671_12 | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 Week_02/id_12/671_12 diff --git a/Week_02/id_12/671_12 b/Week_02/id_12/671_12 new file mode 100644 index 00000000..df50f41d --- /dev/null +++ b/Week_02/id_12/671_12 @@ -0,0 +1,31 @@ +/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode(int x) { val = x; } + * } + */ +class Solution { + public int findSecondMinimumValue(TreeNode root) { + return traversal(root,root.val); + } + + private int traversal(TreeNode root,int value){ + if(root == null){ + return -1; + } + if(root.val > value){ + return root.val; + } + int l = traversal(root.left,value); + int r = traversal(root.right,value); + + if(l>=0 && r>=0){ + return Math.min(l,r); + } + return Math.max(l,r); + } + +} From 7e21ecc526339fd75f55b60380bad9d8f0d3109b Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sun, 5 May 2019 21:54:14 +0800 Subject: [PATCH 03/12] Create 104_12 --- Week_03/id_12/104_12 | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 Week_03/id_12/104_12 diff --git a/Week_03/id_12/104_12 b/Week_03/id_12/104_12 new file mode 100644 index 00000000..98a17303 --- /dev/null +++ b/Week_03/id_12/104_12 @@ -0,0 +1,15 @@ +/** + * Definition for a binary tree node. + * public class TreeNode { + * int val; + * TreeNode left; + * TreeNode right; + * TreeNode(int x) { val = x; } + * } + */ +class Solution { + public int maxDepth(TreeNode root) { + if(root == null){return 0;} + return Math.max(maxDepth(root.left)+1, maxDepth(root.right)+1); + } +} From 8a2412242b05366c3a4413dd1fbb09b4df11fc8a Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sun, 5 May 2019 21:54:40 +0800 Subject: [PATCH 04/12] Create 997_12 --- Week_03/id_12/997_12 | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 Week_03/id_12/997_12 diff --git a/Week_03/id_12/997_12 b/Week_03/id_12/997_12 new file mode 100644 index 00000000..35d36be4 --- /dev/null +++ b/Week_03/id_12/997_12 @@ -0,0 +1,31 @@ +class Solution { + + /** + * @param Integer $N + * @param Integer[][] $trust + * @return Integer + */ + function findJudge($N, $trust) { + if(count($trust)==1){ + return $trust[0][1]; + } + if(count($trust)==0){ + return 1; + } + + $countArr = []; + foreach($trust as $key=>$val){ + $countArr[$val[0]] = -1; + if($countArr[$val[1]] !=-1){ + $countArr[$val[1]]++; + } + } + + for($i=0;$i<=$N;$i++){ + if($countArr[$i] == $N-1){ + return $i; + } + } + return -1; + } +} From 28b5ef093a0e342611deb7d6f350984ba258df37 Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sat, 11 May 2019 11:38:04 +0800 Subject: [PATCH 05/12] Create LeetCode_720_12.php --- Week_04/LeetCode_720_12.php | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 Week_04/LeetCode_720_12.php diff --git a/Week_04/LeetCode_720_12.php b/Week_04/LeetCode_720_12.php new file mode 100644 index 00000000..ea23eb8a --- /dev/null +++ b/Week_04/LeetCode_720_12.php @@ -0,0 +1,24 @@ +class Solution { + + /** + * @param String[] $words + * @return String + */ + function longestWord($words) { + + asort($words); + $arrTem = array(); + $res = ''; + foreach($words as $key=>$val){ + $strLen = strlen($val); + $strTem = substr($val,0,$strLen-1); + if($strLen == 1 || in_array($strTem,$arrTem)){ + $arrTem[$key] = $val; + $res = $strLen > strlen($res) ? $val : $res; + } + } + return $res; + + } + +} From 98cebc4f6b1fee5251e721f70096bfe59b3b3012 Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sat, 11 May 2019 11:39:17 +0800 Subject: [PATCH 06/12] Create 169_12.php --- Week_04/169_12.php | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 Week_04/169_12.php diff --git a/Week_04/169_12.php b/Week_04/169_12.php new file mode 100644 index 00000000..ebce86ce --- /dev/null +++ b/Week_04/169_12.php @@ -0,0 +1,19 @@ +class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function majorityElement($nums) { + $numsTem = $maxArr = array(); + foreach($nums as $key=>$val){ + if(in_array($val,$numsTem)){ + $maxArr[$val]++; + }else{ + $numsTem[$val] = $val; + $maxArr[$val] = 1; + } + } + return array_search(max($maxArr),$maxArr); + } +} From 19729d627ecea2b5c96e78104d3e114a2da96ee2 Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sat, 11 May 2019 11:41:11 +0800 Subject: [PATCH 07/12] Create LeetCode_455_12.php --- Week_04/id_12/LeetCode_455_12.php | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 Week_04/id_12/LeetCode_455_12.php diff --git a/Week_04/id_12/LeetCode_455_12.php b/Week_04/id_12/LeetCode_455_12.php new file mode 100644 index 00000000..342cf98a --- /dev/null +++ b/Week_04/id_12/LeetCode_455_12.php @@ -0,0 +1,24 @@ +class Solution { + + /** + * @param Integer[] $g + * @param Integer[] $s + * @return Integer + */ + function findContentChildren($g, $s) { + + asort($g); + asort($s); + $g = array_values($g); + $s = array_values($s); + $child = $cake = 0; + while($child < count($g) && $cake < count($s)){ + if($g[$child] <= $s[$cake]){ + $child++; + var_dump($child); + } + $cake++; + } + return $child; + } +} From 4e21bed3401cd3edae5cf0be53c74218504226df Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sat, 11 May 2019 11:46:06 +0800 Subject: [PATCH 08/12] Rename 169_12.php to LeetCode_169_12.php --- Week_04/{169_12.php => LeetCode_169_12.php} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Week_04/{169_12.php => LeetCode_169_12.php} (100%) diff --git a/Week_04/169_12.php b/Week_04/LeetCode_169_12.php similarity index 100% rename from Week_04/169_12.php rename to Week_04/LeetCode_169_12.php From a511099a3932ca5f781e06295dd3ff069e9189d0 Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sat, 11 May 2019 15:27:59 +0800 Subject: [PATCH 09/12] Create LeetCode_169_12.php --- Week_04/id_12/LeetCode_169_12.php | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 Week_04/id_12/LeetCode_169_12.php diff --git a/Week_04/id_12/LeetCode_169_12.php b/Week_04/id_12/LeetCode_169_12.php new file mode 100644 index 00000000..ebce86ce --- /dev/null +++ b/Week_04/id_12/LeetCode_169_12.php @@ -0,0 +1,19 @@ +class Solution { + + /** + * @param Integer[] $nums + * @return Integer + */ + function majorityElement($nums) { + $numsTem = $maxArr = array(); + foreach($nums as $key=>$val){ + if(in_array($val,$numsTem)){ + $maxArr[$val]++; + }else{ + $numsTem[$val] = $val; + $maxArr[$val] = 1; + } + } + return array_search(max($maxArr),$maxArr); + } +} From 8cb651a383ee7ee8f236206d908abb1e438995ea Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sat, 11 May 2019 15:29:57 +0800 Subject: [PATCH 10/12] Create LeetCode_720_12.php --- Week_04/id_12/LeetCode_720_12.php | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 Week_04/id_12/LeetCode_720_12.php diff --git a/Week_04/id_12/LeetCode_720_12.php b/Week_04/id_12/LeetCode_720_12.php new file mode 100644 index 00000000..ea23eb8a --- /dev/null +++ b/Week_04/id_12/LeetCode_720_12.php @@ -0,0 +1,24 @@ +class Solution { + + /** + * @param String[] $words + * @return String + */ + function longestWord($words) { + + asort($words); + $arrTem = array(); + $res = ''; + foreach($words as $key=>$val){ + $strLen = strlen($val); + $strTem = substr($val,0,$strLen-1); + if($strLen == 1 || in_array($strTem,$arrTem)){ + $arrTem[$key] = $val; + $res = $strLen > strlen($res) ? $val : $res; + } + } + return $res; + + } + +} From 26332768c8a38cd6c8664dca30f830bf229e792a Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sat, 11 May 2019 15:46:10 +0800 Subject: [PATCH 11/12] Delete LeetCode_169_12.php --- Week_04/LeetCode_169_12.php | 19 ------------------- 1 file changed, 19 deletions(-) delete mode 100644 Week_04/LeetCode_169_12.php diff --git a/Week_04/LeetCode_169_12.php b/Week_04/LeetCode_169_12.php deleted file mode 100644 index ebce86ce..00000000 --- a/Week_04/LeetCode_169_12.php +++ /dev/null @@ -1,19 +0,0 @@ -class Solution { - - /** - * @param Integer[] $nums - * @return Integer - */ - function majorityElement($nums) { - $numsTem = $maxArr = array(); - foreach($nums as $key=>$val){ - if(in_array($val,$numsTem)){ - $maxArr[$val]++; - }else{ - $numsTem[$val] = $val; - $maxArr[$val] = 1; - } - } - return array_search(max($maxArr),$maxArr); - } -} From 7a90438c31dbb7cadf40adbb2125722f3b4a0d84 Mon Sep 17 00:00:00 2001 From: hijkoo Date: Sat, 11 May 2019 15:46:37 +0800 Subject: [PATCH 12/12] Delete LeetCode_720_12.php --- Week_04/LeetCode_720_12.php | 24 ------------------------ 1 file changed, 24 deletions(-) delete mode 100644 Week_04/LeetCode_720_12.php diff --git a/Week_04/LeetCode_720_12.php b/Week_04/LeetCode_720_12.php deleted file mode 100644 index ea23eb8a..00000000 --- a/Week_04/LeetCode_720_12.php +++ /dev/null @@ -1,24 +0,0 @@ -class Solution { - - /** - * @param String[] $words - * @return String - */ - function longestWord($words) { - - asort($words); - $arrTem = array(); - $res = ''; - foreach($words as $key=>$val){ - $strLen = strlen($val); - $strTem = substr($val,0,$strLen-1); - if($strLen == 1 || in_array($strTem,$arrTem)){ - $arrTem[$key] = $val; - $res = $strLen > strlen($res) ? $val : $res; - } - } - return $res; - - } - -}