2018年5月16日 星期三

Leetcode - 520. Detect Capital

Question
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:
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.

Solution:
bool isup(char ch) {
    if((ch >= 'A') && (ch <= 'Z'))
        return true;
    return false;
}

bool detectCapitalUse(char* word) {
    int i, false_time = 0;
    
    for(i=2; word[i]!='\0'; i++)
    {
        if((isup(word[1])) != (isup(word[i])))
        {
            false_time++;
            break;
        }
    }
    
    if(false_time == 0)
        if((isup(word[0]) == isup(word[1]))||(isup(word[0]) > isup(word[1])))
            return true;
    return false;
}

沒有留言:

張貼留言