LeetCode 520. Detect Capital

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 isupper = false;
        bool haslower = false;
        auto length = word.size();
        ‘A‘ <= word[0] && word[0] <= ‘Z‘ ? (isupper = true) : (isupper = false);
        for (size_t i = 1;i < length;++i)
        {
            if (!isupper&&‘A‘ <= word[i] && word[i] <= ‘Z‘)
                return false;
            if (isupper)
            {
                if (‘A‘ <= word[1] && word[1] <= ‘Z‘)
                {
                    if(‘a‘ <= word[i] && word[i] <= ‘z‘)
                    return false;
                }
                else
                {
                    if (‘A‘ <= word[i] && word[i] <= ‘Z‘)
                        return false;
                }
            }
        }
        return true;
    }
};
时间: 2024-10-23 15:42:16

LeetCode 520. Detect Capital的相关文章

520. Detect Capital【easy】

520. Detect Capital[easy] 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 "U

[LeetCode&amp;Python] Problem 520. Detect Capital

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 t

520. Detect Capital

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 t

[LC] 520. Detect Capital

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 t

Detect Capital

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 t

字符串(1)——Detect Capital

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 t

leetcode 520.检测大写字母

给定一个单词,你需要判断单词的大写使用是否正确. 我们定义,在以下情况时,单词的大写用法是正确的: 全部字母都是大写,比如"USA".单词中所有字母都不是大写,比如"leetcode".如果单词不只含有一个字母,只有首字母大写, 比如 "Google".否则,我们定义这个单词没有正确使用大写字母. 1 class Solution { 2 public boolean detectCapitalUse(String word) { 3 boole

LeetCode Problems List 题目汇总

No. Title Level Rate 1 Two Sum Medium 17.70% 2 Add Two Numbers Medium 21.10% 3 Longest Substring Without Repeating Characters Medium 20.60% 4 Median of Two Sorted Arrays Hard 17.40% 5 Longest Palindromic Substring Medium 20.70% 6 ZigZag Conversion Ea

Leetcode problems classified by company 题目按公司分类(Last updated: October 2, 2017)

Sorted by frequency of problems that appear in real interviews.Last updated: October 2, 2017Google (214)534 Design TinyURL388 Longest Absolute File Path683 K Empty Slots340 Longest Substring with At Most K Distinct Characters681 Next Closest Time482