leetcode[Detect Capital]//待整理多种解法
2017-08-12 00:27
531 查看
解法一:
public class Solution {
public boolean detectCapitalUse(String word) {
//a-z:97-122
//A-Z:65-90
if(word.equals("")) return true;
char c = word.charAt(0);
if(97 <= c && c <= 122){//首字母小写则后面所有的字母都要小写
for(int i = 1; i < word.length(); i++){
c = word.charAt(i);
if(!(97 <= c && c <= 122)){
return false;
}
}
return true;
} else{//首字母大写,要么后面所有字母都小写,要么后面所有字母都大写
//从第二个字母定个基调
if(word.length() == 1){
return true;
} else{
c = word.charAt(1);
if(97 <= c && c <= 122){
for(int i = 2; i < word.length(); i++){
c = word.charAt(i);
if(!(97 <= c && c <= 122)){
return false;
}
}
return true;
} else{
for(int i = 2; i < word.length(); i++){
c = word.charAt(i);
if(!(65 <= c && c <= 90)){
return false;
}
}
return true;
}
}
}
}
}
public class Solution {
public boolean detectCapitalUse(String word) {
//a-z:97-122
//A-Z:65-90
if(word.equals("")) return true;
char c = word.charAt(0);
if(97 <= c && c <= 122){//首字母小写则后面所有的字母都要小写
for(int i = 1; i < word.length(); i++){
c = word.charAt(i);
if(!(97 <= c && c <= 122)){
return false;
}
}
return true;
} else{//首字母大写,要么后面所有字母都小写,要么后面所有字母都大写
//从第二个字母定个基调
if(word.length() == 1){
return true;
} else{
c = word.charAt(1);
if(97 <= c && c <= 122){
for(int i = 2; i < word.length(); i++){
c = word.charAt(i);
if(!(97 <= c && c <= 122)){
return false;
}
}
return true;
} else{
for(int i = 2; i < word.length(); i++){
c = word.charAt(i);
if(!(65 <= c && c <= 90)){
return false;
}
}
return true;
}
}
}
}
}
相关文章推荐
- leetcode [Palindrome Linked List]//待整理多种解法
- leetcode[Binary Tree Paths]//待整理多种解法
- leetcode[Convert BST to Greater Tree]//待整理多种解法
- leetcode[Number of Segments in a String]//待整理多种解法
- leetcode[Two Sum IV - Input is a BST]//待整理多种解法
- leetcode[Reverse String II]//待整理多种解法
- leetcode[Repeated Substring Pattern]//待整理多种解法
- leetcode [Invert Binary Tree]//待整理多种解法
- leetcode [Power of Two]//待整理多种解法
- leetcode [Convert Sorted Array to Binary Search Tree]//待整理多种解法
- leetcode [Majority Element]//待整理多种解法
- leetcode [Number of 1 Bits]//待整理多种解法
- leetcode [Reverse Linked List]//待整理多种解法
- leetcode[Convert a Number to Hexadecimal]//待整理多种解法
- leetcode [Contains Duplicate]//待整理多种解法
- leetcode [Implement Stack using Queues]//待整理多种解法
- leetcode [Minimum Depth of Binary Tree]//待整理多种解法
- leetcode [Pascal's Triangle]//待整理多种解法
- leetcode[Base 7]//待整理多种解法
- leetcode[Diameter of Binary Tree]//待整理多种解法