520. Detect Capital

来源:互联网 发布:有限公司医药软件 编辑:程序博客网 时间:2024/05/17 21:57

题目来源【Leetcode】

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.

这道题很简单,直接根据给的三个条件,满足一个即可:

class Solution {public:    bool detectCapitalUse(string word) {            int count = 0;            for(int i = 0; i < word.length() ; i++){               if(word[i] < 'a') count++;            }            if((count == 1 &&  word[0] < 'a') || count == word.length() || count == 0) return true;         return false;    }};
原创粉丝点击