520. Detect Capital

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, like "Google".

Given a string word, return true if the usage of capitals in it is right.

 

Example 1:

Input: word = "USA"
Output: true

Example 2:

Input: word = "FlaG"
Output: false

Solution: 

class Solution {

public:

    bool detectCapitalUse(string word) {

     int sam=0, cap=0;

     int n = word.length();

        for(int i=0; i<n; i++){

            if(word[i]>= 'a' && word[i] <='z'){

                sam++;

            }

            if(word[i]>='A'&& word[i]<='Z'){

                cap++;

            }

        }

       if(sam ==n|| cap==n)  return true;

       if(word[0]>='A' && word[0]<='Z' && sam == n-1) return true;

       return false;

       

    }

};