-
Notifications
You must be signed in to change notification settings - Fork 10
/
Copy path520.Detect-Capital.java
44 lines (38 loc) · 1.09 KB
/
520.Detect-Capital.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
// https://leetcode.com/problems/detect-capital/
//
// algorithms
// Easy (52.82%)
// Total Accepted: 95,676
// Total Submissions: 181,124
// beats 100.0% of java submissions
class Solution {
public boolean detectCapitalUse(String word) {
int len = word.length();
if (len == 0) {
return true;
}
char[] chArr = word.toCharArray();
if (Character.isLowerCase(chArr[0])) {
for (int i = 1; i < len; i++) {
if (Character.isUpperCase(chArr[i])) {
return false;
}
}
return true;
} else {
boolean lower = true;
if (len > 1 && Character.isUpperCase(chArr[1])) {
lower = false;
}
for (int i = 1; i < len; i++) {
if (lower && Character.isUpperCase(chArr[i])) {
return false;
}
if (!lower && Character.isLowerCase(chArr[i])) {
return false;
}
}
return true;
}
}
}