Merge pull request algorithm001#705 from GradyWong/master

GeekUniversity · web-flow · commit 0e599092b3aa · 2019-05-13T17:21:47.000+08:00
BJ001-1904069 第四周作业
diff --git a/Week_04/id_69/LeetCode_169_69.java b/Week_04/id_69/LeetCode_169_69.java
@@ -0,0 +1,19 @@
+class Solution {
+    public int majorityElement(int[] nums) {
+         // 初始放入第一个元素并开始计数
+        int maj = nums[0];
+        int count = 1;
+        // 第二个元素开始比较
+        for (int i = 1; i < nums.length; i++) {
+            if (maj == nums[i])
+                count++;
+            else {
+                count--;
+                if (count == 0) {
+                    maj = nums[i + 1];
+                }
+            }
+        }
+        return maj;
+    }
+}
diff --git a/Week_04/id_69/LeetCode_720_69.java b/Week_04/id_69/LeetCode_720_69.java
@@ -0,0 +1,17 @@
+class Solution {
+    public String longestWord(String[] words) {
+         // 对字符串数组进行排序
+        Arrays.sort(words);
+
+        Set<String> set = new HashSet<>();
+        String result = new String();
+        for (String str : words) {
+            if (set.contains(str.substring(0, str.length() - 1)) || str.length() == 1) {
+                // 保存更长的哪一个字符串
+                result = str.length() > result.length() ? str : result;
+                set.add(str);
+            }
+        }
+        return result;
+    }
+}
