您的位置 首页 JAVA(2017)

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:

  1. All letters in this word are capitals, like “USA”.
  2. All letters in this word are not capitals, like “leetcode”.
  3. 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.length() == 1) return true;
        if((word.charAt(0) - 'a')>=0){
            for(int i=1;i<word.length();i++){
                if((word.charAt(i) - 'a')<0){
                    return false;
                }
            }
        }
        else{
            if((word.charAt(1) - 'a')>=0){
                for(int i=2;i<word.length();i++){
                    if((word.charAt(i) - 'a')<0){
                        return false;
                    }
                }                
            }
            else{
                for(int i=1;i<word.length();i++){
                    if((word.charAt(i) - 'a')>=0){
                        return false;
                    }
                }                
            }
        }
        return true;
    }
}
看完了?留个评分呗?
[0人评了分,平均: 0/5]

本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注:

原文来源:《LeetCode – 520. Detect Capital》

发表评论

电子邮件地址不会被公开。

返回顶部