-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdetectCapital
54 lines (48 loc) · 1.69 KB
/
detectCapital
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
45
46
47
48
49
50
51
52
53
54
/(*******************************/
Given a word, you need to judge whether the usage of capitals in it is right or not.
We define the usage of capitals in a word to be right when one of the following cases holds:
All letters in this word are capitals, like "USA".
All letters in this word are not capitals, like "leetcode".
Only the first letter in this word is capital if it has more than one letter, like "Google".
Otherwise, we define that this word doesn't use capitals in a right way.
Example 1:
Input: "USA"
Output: True
Example 2:
Input: "FlaG"
Output: False
Note: The input will be a non-empty word consisting of uppercase and lowercase latin letters.
/*********************************/
Given a word, you need to judge whether the usage of capitals in it is right or not.
We define the usage of capitals in a word to be right when one of the following cases holds:
All letters in this word are capitals, like "USA".
All letters in this word are not capitals, like "leetcode".
Only the first letter in this word is capital if it has more than one letter, like "Google".
Otherwise, we define that this word doesn't use capitals in a right way.
Example 1:
Input: "USA"
Output: True
Example 2:
Input: "FlaG"
Output: False
Note: The input will be a non-empty word consisting of uppercase and lowercase latin letters.
bool detectCapitalUse(string word) {
int size = word.size();
int count1 = 0;
int count2 = 0;
for (int i = 1; i < size;i++) {
if (islower(word[i])) {
count1++;
}
else {
count2++;
}
}
cout << "count1:" << count1<< endl;
cout << "count2:" << count2 << endl;
if (count1 == size-1|| (isupper(word[0]) && count2 == size - 1)) {
return true;
}
return false;
}
};