[LeetCode] Problem 520 - Detect Capital

Posted on | In ,

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

No.1

Input: “USA”

Output: True

No.2

Input: “FlaG”

Output: False

Note

The input will be a non-empty word consisting of uppercase and lowercase latin letters.

Code

1
2
3
4
5
6
7
8
9
10
11
public boolean detectCapitalUse(String word) {
    int n = word.length();
    int count = 0;

    for (char ch : word.toCharArray()) {
        if (Character.isUpperCase(ch))
            count++;
    }

    return count == n || count == 0 || (count == 1 && Character.isUpperCase(word.charAt(0)));
}