LeetCode520 Detect Capital

文章目录
  1. 1. 描述
  2. 2. 样例
  3. 3. 思路
  4. 4. 代码

描述

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.

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

样例

Example 1:

1
2
Input: "USA"
Output: True

Example 2:

1
2
Input: "FlaG"
Output: False

思路

判断一个字符串是否由全是大写字母或全是小写字母或开头大写其余小写组成。

记录大写字母的个数,特判一下即可。

代码

1
2
3
4
5
6
7
8
class Solution {
public:
bool detectCapitalUse(string word) {
int count = 0;
for (auto& c: word) if (isupper(c)) count++;
return (count == 0) || (count == word.size()) || (count == 1 && isupper(word[0]));
}
};
分享到 评论