leetcode 520 Detect Capp(Easy)

来源:互联网 发布:大道寺知世家多有钱 编辑:程序博客网 时间:2024/06/10 08:47

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.

练习下简单题目,直接三种情况判断了,代码很长,可以再精简的。

import java.util.Scanner;class Solution {    public boolean detectCapitalUse(String word) {        boolean flag_one = false;        boolean flag_two = false;        boolean flag_three = false;        int i;        flag_one = true;        for(i=0;i<word.length();i++){            if(Character.isUpperCase(word.charAt(i))){                flag_one = false;                break;            }        }        flag_two = true;        for(i=0;i<word.length();i++){            if(Character.isLowerCase(word.charAt(i))){                flag_two = false;                break;            }        }           if(Character.isUpperCase(word.charAt(0))){            flag_three = true;            for(i=1;i<word.length();i++){                if(Character.isUpperCase(word.charAt(i))){                flag_three = false;                break;            }              }        }        if(flag_one||flag_two||flag_three){            return true;        }       return false;    }                   }