zoukankan      html  css  js  c++  java
  • LeetCode

    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 == 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;
        }
    }
  • 相关阅读:
    Hive 使用问题集锦
    scala def/val/lazy val区别以及call-by-name和call-by-value
    spark学习流程
    Hadoop
    Hive
    Chrome快捷键
    Java API帮助文档
    Java 访问修饰符与非访问修饰符
    java 关键字
    Solr配置Ikanalyzer分词器
  • 原文地址:https://www.cnblogs.com/wxisme/p/7338468.html
Copyright © 2011-2022 走看看