LeetCode 520. Delete Capital

最新推荐文章于 2021-11-27 21:25:26 发布

原创最新推荐文章于 2021-11-27 21:25:26 发布 · 161 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 题解 C++版专栏收录该内容

138 篇文章

订阅专栏

本文介绍了一种算法，用于判断单词中大写字母的使用是否符合特定规则：全大写如'USA'，全小写如'leetcode'，或仅首字母大写如'Google'。通过两个示例说明了正确与错误的用法，并提供了两种实现方法，包括模拟和简化计数法。

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

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.

v1:模拟

class Solution {
public:
    bool detectCapitalUse(string word) {
        if (word.size() == 1) return true;
        int first = word[0], second = word[1];
        if (first<= 90) {
            // 情况1
            int i = 2;
            if (second <= 90) {
                for (; i < word.size(); i ++ )
                    if (word[i] > 90) break;
            }
            // 情况3
            else {
                for (; i < word.size(); i ++ )
                    if (word[i] <= 90) break;
            }
            if (i != word.size()) return false;
        }
        // 情况2
        else {
            for (auto c : word) {
                if (c <= 90) return false;
            }
        }
        return true;
    }
};

v2：只找从头节点起连续的大写字母的数量

class Solution {
public:
    bool detectCapitalUse(string word) {
        int cnt = 0;
        for(char c: word) if(c <= 90) cnt++;
        return ((cnt==0 || cnt==word.length()) || (cnt==1 && word[0]<=90));
    }
};