forked from sureshmangs/Code
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay-01-Detect Capital.cpp
51 lines (28 loc) · 1010 Bytes
/
Day-01-Detect Capital.cpp
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
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, 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.
class Solution {
public:
bool detectCapitalUse(string word) {
int n=word.length();
int sm=0, bg=0;
for(int i=0;i<n;i++){
if(word[i]>='a' && word[i]<='z') sm++;
else bg++;
}
if(bg==n) return true;
if(sm==n) return true;
if((word[0]>='A' && word[0]<='Z') && sm==n-1) return true;
return false;
}
};