leetcode 520[easy]---Detect Capital
来源:互联网 发布:linux :wq没有保存退出 编辑:程序博客网 时间:2024/05/19 22:05
难度: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 "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".
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.
思路:题目啰啰嗦嗦一大堆,简而言之就是只有符合 1. 全是大写 2.全是小写 3. 只有首字母是大写 三个条件之一的string才是True,否则就是false
用 str.islower() 和str.isupper() 判读,一行code搞定
阅读全文
0 0
- leetcode 520[easy]---Detect Capital
- leetcode 520. Detect Capital(easy)
- leetcode-520-Detect Capital
- Leetcode #520 Detect Capital
- [LeetCode]520 Detect Capital
- LeetCode 520:Detect Capital
- LeetCode 520 Detect Capital
- Leetcode 520 Detect Capital
- LeetCode 520 Detect Capital
- 【LeetCode】520 Detect Capital
- Leetcode 520 Detect Capital
- LeetCode.520 Detect Capital
- leetcode 520 Detect Capital C++
- 520. Detect Capital Easy
- LeetCode-Easy部分中标签为String 520. Detect Capital
- LeetCode 520:Detect Capital (c++)
- LeetCode 520 Detect Capital 检测大写
- 520.Detect Capital(String-Easy)
- 程序员的幽默你不懂
- 前端学记之CSS-背景
- Ubuntu 建立 virtualenv 虚拟环境并安装Django
- Node.js实现歌词打印输出
- redis学习之路
- leetcode 520[easy]---Detect Capital
- 一种便捷的Android软件版本更新方法
- zookeeper session实现机制
- libCurl库 学习
- 数据结构实验之数组三:快速转置
- PyCharm专业版的安装
- ES常用命令及注意事项
- 数据结构实验之二叉树一:树的同构
- CSDN-markdown教程