520. Detect Capital

Posted MarkLeeBYR

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了520. Detect Capital相关的知识,希望对你有一定的参考价值。

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.

//对三种情况分别判断

A的ascii码65,Z的ascii码90, a的ascii码97

class Solution {

    public boolean detectCapitalUse(String word) {

        int count = 0;

        for (char c : word.toCharArray())

            if (‘Z‘ - c >= 0)

                count++;

        return count == 0 || count == word.length() || (count == 1 && ‘Z‘ - word.charAt(0) >= 0);

    }

}

以上是关于520. Detect Capital的主要内容,如果未能解决你的问题,请参考以下文章

520. Detect Capital

LeetCode 520. Detect Capital

Leetcode 520. Detect Capital

LeetCode - 520. Detect Capital

520. Detect Capital

leetcode-520-Detect Capital