520. Detect Capital
来源:互联网 发布:如寡人者 安与知耻 编辑:程序博客网 时间:2024/06/05 21:49
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.
给出一个字符 给定三种正确判定方式:
全为大写,全为小写,首字母大写
否则判错
code:
class Solution(object):
def detectCapitalUse(self, word):
"""
:type word: str
:rtype: bool
"""
if word.lower()==word or word.upper()==word or word[0].upper() + word[1:].lower() ==word:
return True
else :
return False
# 简写
# return word.islower() or word.isupper() or word.istitle()
0 0
- 【Leetcode】520. Detect Capital
- 520. Detect Capital (E)
- LeetCode 520. Detect Capital
- LeetCode 520. Detect Capital
- 520. Detect Capital
- LeetCode-520. Detect Capital
- 520. Detect Capital
- leetcode 520. Detect Capital
- 520. Detect Capital
- 520. Detect Capital
- 520. Detect Capital
- 520. Detect Capital
- leetcode 520. Detect Capital
- [leetcode] 520. Detect Capital
- 520. Detect Capital Easy
- 520. Detect Capital
- [LeetCode]520. Detect Capital
- 520. Detect Capital
- 欢迎使用CSDN-markdown编辑器
- PLSQL创建表空间和用户并授权
- 进程的特性与状态
- HihoCoder
- Redis的哨兵
- 520. Detect Capital
- 关于继承构造器的调用
- 虚拟机 linux ubuntu 与 win7 系统之间文件夹共享
- greedy LeetCode 316. Remove Duplicate Letters
- 集合或字符串组合排列
- hdu1097 A hard puzzle(快速幂)
- ping:检查网络是否连通的Dos命令
- 51Nod-1310-Chandrima and XOR
- 【转自eguid大神】实时监控、直播流、流媒体、视频网站开发方案设计简要