Leetcode 520. Detect Capital

标签：public   input   basic   list   ret   字符   .com   ext   字符串   

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.

Next challenges: Compare Version Numbers Basic Calculator II Ransom Note

思路：Java中判断2个字符串是否相等不能用"=="，要用"equal"。字符比较可以用"=="。

代码：

1 public class Solution {
2     public boolean detectCapitalUse(String word) {
3         return word == word.toUpperCase() || word == word.toLowerCase() || (word.length() > 1 && Character.toUpperCase(word.charAt(0)) == word.charAt(0) && word.substring(1).toLowerCase().equals(word.substring(1)));
4     }
5 }

Leetcode 520. Detect Capital

标签：public   input   basic   list   ret   字符   .com   ext   字符串   

原文地址：http://www.cnblogs.com/Deribs4/p/7221331.html