LeetCode 520 Detect Capital
来源:互联网 发布:一键手绘图的软件 编辑:程序博客网 时间:2024/05/19 22:25
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.
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.
这个题是一个字符串合法性判断的题目,可以考虑用DFA。LeetCode 65(https://leetcode.com/problems/valid-number/#/description)也是类似的题目,不过65题AC率只有12.7%,一度是AC率最低的题。闲言少叙。看这个题。
我划分了7个状态:
0 开始
1 只有一个大写字母
2 只有一个小写字母
3 大写后面加了一个大写
4 大写后面加了一个小写
5 小写后边加了一个小写
6 非法(exit)
状态矩阵:
0123450(大写)1363661(小写)245655显而易见地得出代码:
- 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++
- leetcode 520[easy]---Detect Capital
- LeetCode 520:Detect Capital (c++)
- LeetCode 520 Detect Capital 检测大写
- 【Leetcode】520. Detect Capital
- LeetCode 520. Detect Capital
- LeetCode 520. Detect Capital
- LeetCode:Detect Capital
- JSP常用跳转方式
- Pycham 破解
- 基于scrapy的简单爬虫
- 自定义Filter过滤集合中的元素
- 注释驱动的 Spring cache 缓存介绍
- LeetCode 520 Detect Capital
- JAVA 攻城狮 第二天
- java中的过滤器
- gdb的使用指南(上)
- iOS 开发RunTime之函数调用
- [C++基础] 字符编码
- Ubuntu修改环境变量
- 见习报告
- Android项目中版本管理需要忽略的文件