Skip to content

BJ001-1904069 第四周作业 #705

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
GeekUniversity merged 2 commits into from
May 13, 2019
Merged

BJ001-1904069 第四周作业 #705

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
22d52a1
Create LeetCode_720_69.java
GradyWong May 12, 2019
ef4280c
Create LeetCode_169_69.java
GradyWong May 12, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions Week_04/id_69/LeetCode_169_69.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
}
}
17 changes: 17 additions & 0 deletions Week_04/id_69/LeetCode_720_69.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
}
}