首页 > 代码库 > leetcode-520-Detect Capital
leetcode-520-Detect Capital
leetcode-520-Detect Capital
520. Detect Capital
My SubmissionsBack To Contest
- User Accepted: 1256
- User Tried: 1300
- Total Accepted: 1290
- Total Submissions: 2464
- Difficulty: 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.
使用模拟法，模拟通过，easy 题目
class Solution {
public:
bool detectCapitalUse(string word) {
int j, i = 0, len = word.size();
while(i < len){
if(word[i] >= ‘A‘ && word[i] <= ‘Z‘){
if(i > 0 && word[i-1] !=‘ ‘){
return false;
}
j = i+1;
while(j < len && word[j]>=‘A‘ && word[j]<=‘Z‘){
j++;
}
if(j < len && j>(i+1) && word[j] != ‘ ‘){
return false;
}
i = j;
}else{
i++;
}
}
return true;
}
};
leetcode-520-Detect Capital
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。