首页 > 代码库 > LeetCode - 520. Detect Capital
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:
- 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.
public class Solution { public boolean detectCapitalUse(String word) { if (word == null) return true; int upCnt = 0; for (int i=0; i<word.length(); i++) { char ch = word.charAt(i); if (ch>=‘A‘ && ch<=‘Z‘) upCnt ++; } if (upCnt==word.length() || upCnt==0) return true; else { if (upCnt == 1 && word.charAt(0)>=‘A‘&&word.charAt(0)<=‘Z‘) return true; } return false; } }
LeetCode - 520. Detect Capital
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。