[LeetCode&Python] Problem 520. Detect Capital

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了[LeetCode&Python] Problem 520. Detect Capital，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含993字，纯文字阅读大概需要2分钟。

内容图文

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(object):
    def detectCapitalUse(self, word):
        """
        :type word: str
        :rtype: bool
        """
        n=len(word)
        if word[0].isupper():
            if n>1:
                if word[1].isupper():
                    for i in word[2:]:
                        if i.islower():
                            return False
                    return True
                else:
                    for i in word[2:]:
                        if i.isupper():
                            return False
                    return True
            else:
                return True
        else:
            if n>1:
                for i in word[1:]:
                    if i.isupper():
                        return False
                return True
            else:
                return True

内容总结

以上是互联网集市为您收集整理的[LeetCode&Python] Problem 520. Detect Capital全部内容，希望文章能够帮你解决[LeetCode&Python] Problem 520. Detect Capital所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端