LeetCode: 520 Detect Capital(easy)

本文介绍了一种检测单词中大写字母使用是否正确的算法。该算法通过三种情况判断:所有字母大写,如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:

  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.

代码:

自己的:

class Solution {
public:
    bool detectCapitalUse(string word) {
        bool result = 1;
        if (word[0] < 'a'){
            if (word[1] < 'a'){
                for(int i = 2; i < word.size(); i++){
                    if(word[i] > 'Z'){
                        result = 0;
                        break;
                    }
                }
            }
            else{
                for(int i = 2; i < word.size(); i++){
                    if(word[i] < 'a'){
                        result = 0;
                        break;
                    }
                }
            }
        }
        else{
            for(auto c : word){
                if (c < 'a'){
                    result = 0;
                    break;
                }
            }
        }
        return result;  
    }
};

别人的:

class Solution {
public:
    bool detectCapitalUse(string word) {
        int cnt = 0;
        for(int a = 0; a < word.length(); a++ ) {
            if('Z' - word[a] >= 0) 
                cnt++;
        }
        if(cnt == word.length() || cnt == 0 || (cnt == 1 && ('Z' - word[0] >= 0)))
            return true;
        return false;
        
    }
};

对大写字母计数,然后再判断(全是大写、全是小写、首字母大写)

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值