0520. Detect Capital (E)

Detect Capital (E)

题目

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, 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.

---

题意

判断给定字符串中的大写字母是否合法：1. 只有首字母大写；2. 没有大写字母；3. 全是大写字母。

思路

统计字符串中大写字母的个数，并分情况进行判断。

---

代码实现

Java

class Solution {
    public boolean detectCapitalUse(String word) {
        int count = 0;
        for (char c : word.toCharArray()) {
            count += c <= 'Z' && c >= 'A' ? 1 : 0;
        }
        return count == 1 && word.charAt(0) <= 'Z' && word.charAt(0) >= 'A' || count == 0 || count == word.length();
    }
}