520. Detect Capital

1.问题描诉

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:
1. All letters in this word are capitals, like “USA”.
2. All letters in this word are not capitals, like “leetcode”.
3. 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.

来自 https://leetcode.com/problems/detect-capital/description/

2.题目分析

给定一个单词，判断其用法是否正确，正确的用法有以下三种：1.全部是大写；2.全部是小写；3.只有首字母是大写。因此，遍历一遍元素，计算出大写字母的个数cnt，如果cnt和单词的长度一样，说明满足条件1；如果cnt==0,则说明满足条件2；如果cnt==1且首字母大写，则满足条件3。

3.C++代码

//我的代码：(beats 57%)
bool detectCapitalUse(string word) 
{
    int cnt = 0;
    for (int i = 0; i < word.length(); i++)
    {
        if (word[i]>='A'&&word[i]<='Z')
            cnt++;
    }
    if (cnt == word.length() || cnt == 0)
        return true;
    else if (cnt == 1 && word[0] >= 'A'&&word[0] <= 'Z')
        return true;
    else
        return false;
}