520. Detect Capital

2021-06-08 23:06

阅读：315

标签：sci tca amp int follow col The strong 情况

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:

All letters in this word are capitals, like "USA".
All letters in this word are not capitals, like "leetcode".
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

标签：sci tca amp int follow col The strong 情况

原文地址：https://www.cnblogs.com/MarkLeeBYR/p/10678564.html

文章来自：搜素材网的编程语言模块，转载请注明文章出处。
文章标题：520. Detect Capital
文章链接：http://soscw.com/index.php/essay/92419.html

亲，登录后才可以留言！