美文网首页
520. Detect Capital

520. Detect Capital

作者: matrxyz | 来源:发表于2018-01-14 05:58 被阅读0次

    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.

    Solution:

    思路:
    Time Complexity: O(N) Space Complexity: O(N)

    Solution Code:

    public class Solution {
        public boolean detectCapitalUse(String word) {
            int cnt = 0;
            for(char c: word.toCharArray()) if('Z' - c >= 0) cnt++;
            return ((cnt==0 || cnt==word.length()) || (cnt==1 && 'Z' - word.charAt(0)>=0));
        }
    }
    

    相关文章

      网友评论

          本文标题:520. Detect Capital

          本文链接:https://www.haomeiwen.com/subject/agahoxtx.html