Skip to content

最长公共前缀题目数组检测函数修复 #410

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
Snailclimb merged 3 commits into from
Jul 25, 2019
Merged

最长公共前缀题目数组检测函数修复 #410

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
ac3a10a
Merge pull request #1 from Snailclimb/master
keepal7 Jul 25, 2019
47776db
最长公共前缀题目数组检测函数修复
keepal7 Jul 25, 2019
45e24a8
最长公共前缀题目数组检测函数修复
keepal7 Jul 25, 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
26 changes: 15 additions & 11 deletions docs/dataStructures-algorithms/几道常见的子符串算法题.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -135,17 +135,21 @@ public class Main {

}

private static boolean checkStrs(String[] strs) {
if (strs != null) {
// 遍历strs检查元素值
for (int i = 0; i < strs.length; i++) {
if (strs[i] == null || strs[i].length() == 0) {
return false;
}
}
}
return true;
}
private static boolean chechStrs(String[] strs) {
boolean flag = false;
if (strs != null) {
// 遍历strs检查元素值
for (int i = 0; i < strs.length; i++) {
if (strs[i] != null && strs[i].length() != 0) {
flag = true;
} else {
flag = false;
break;
}
}
}
return flag;
}

// 测试
public static void main(String[] args) {
Expand Down