leetcode-520-Detect Capital

Posted 2020-08-31 zhang--yd

leetcode-520-Detect Capital 

520. Detect Capital

My SubmissionsBack To Contest

 

• User Accepted: 1256
• User Tried: 1300
• Total Accepted: 1290
• Total Submissions: 2464
• Difficulty: Easy

 

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.

 

使用模拟法，模拟通过，easy 题目

 

 

class Solution {
public:
    bool detectCapitalUse(string word) {
        int j, i = 0, len = word.size(); 
        while(i < len){
            if(word[i] >= ‘A‘ && word[i] <= ‘Z‘){
                if(i > 0 && word[i-1] !=‘ ‘){
                    return false; 
                }
                j = i+1; 
                while(j < len && word[j]>=‘A‘ && word[j]<=‘Z‘){
                    j++; 
                }
                if(j < len && j>(i+1) && word[j] != ‘ ‘){
                    return false; 
                }
                i = j; 
            }else{
                i++; 
            }
        }
        return true; 
    }
};