Detect Capital (E)
題目
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, 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.
題意
判斷給定字串中的大寫字母是否合法：1. 只有首字母大寫；2. 沒有大寫字母；3. 全是大寫字母，
思路
統計字串中大寫字母的個數，并分情況進行判斷，
代碼實作
Java
class Solution {
public boolean detectCapitalUse(String word) {
int count = 0;
for (char c : word.toCharArray()) {
count += c <= 'Z' && c >= 'A' ? 1 : 0;
}
return count == 1 && word.charAt(0) <= 'Z' && word.charAt(0) >= 'A' || count == 0 || count == word.length();
}
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/6719.html
標籤：其他
上一篇：layui下select禁止點擊
下一篇：藍橋杯 試題 演算法訓練 審美課