LeetCode 520. Detect Capital

520. Detect Capital

Description

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

Solution

• 题目意思就是判断字符串是否满足给定的特性，只要满足三者之一即可。全是大写或者全是小写或是只有第一个字母是大写，其余是小写。
• 我的思路很简单，将分成三种情况，首字母和第二个字字母都是大写和首字母大写第二个字母小写和首字母小写。
• 对于第一种，得保证接下来的都是大写，对于后两种得保证接下来的都是小写。代码如下：

class Solution {
public:
    bool detectCapitalUse(string word) {
        if (isupper(word[0]) && isupper(word[1])) {
            for (int i = 2;i < word.size();i++) {
                if (!isupper(word[i]))
                    return false;
            }
        }
        else {   //此处将后两种情况合并，因为处理方式近乎相同（起始下标不同，但是可以从i=1开始完成合并）
            for (int i = 1;i < word.size();i++) {
                if (isupper(word[i]))
                    return false;
            }
        }
        return true;
    }
};