Detect Capital

最新推荐文章于 2023-10-26 13:57:20 发布

原创最新推荐文章于 2023-10-26 13:57:20 发布 · 275 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一个用于判断单词是否正确使用了大写字母的算法。该算法能够检查单词是否全部为大写、全部为小写或者仅首字母大写的情况，并据此返回判断结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

https://leetcode.com/problems/detect-capital/?tab=Description

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.

bool bIsUpper(char ch) {
    return (ch >= 'A' && ch <= 'Z');
}

bool detectCapitalUse(char* word) {
    int len = strlen(word);
    int firstIsUpper = false;
    int i;
    if(len <= 1) return true;
    firstIsUpper = bIsUpper(word[0]);
    for(i = 1; i < len; i++) {
        if(firstIsUpper) {
            if(i != 1 && (bIsUpper(word[i]) != bIsUpper(word[i-1]))) break;
        }
        else {
            if(bIsUpper(word[i])) break;
        }
    }
    return (i == len)?true:false;
}