LeetCode - Easy - 520. Detect Capital

Topic

  • String

Description

https://leetcode.com/problems/detect-capital/

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, like "Google".

Given a string word, return true if the usage of capitals in it is right.

Example 1:

Input: word = "USA"
Output: true

Example 2:

Input: word = "FlaG"
Output: false

Constraints:

  • 1 <= word.length <= 100
  • word consists of lowercase and uppercase English letters.

Analysis

方法一:字符统计

方法二:正则表达式

Submission

public class DetectCapital {
	
    public boolean detectCapitalUse(String word) {
        int capitalCount = 0, notCapitalCount = 0;
        boolean firstLetterCapital = Character.isUpperCase(word.charAt(0));
        
        for(int i = 0; i < word.length(); i++) {
        	if(Character.isUpperCase(word.charAt(i))) {
        		capitalCount++;
        	}else {
        		notCapitalCount++;
        	}
        }
        
        return firstLetterCapital && notCapitalCount == word.length() - 1 //
        		|| notCapitalCount == word.length()//
        		|| capitalCount == word.length(); 
    }
    
    public boolean detectCapitalUse2(String word) {
        return word.matches("[A-Z]*|[A-Z]?[a-z]*");
    }
    
}

Test

public class DetectCapitalTest {

	@Test
	public void test() {
		DetectCapital obj = new DetectCapital();

		assertTrue(obj.detectCapitalUse("USA"));
		assertTrue(obj.detectCapitalUse("leetcode"));
		assertTrue(obj.detectCapitalUse("Google"));
		assertTrue(obj.detectCapitalUse("g"));
		assertFalse(obj.detectCapitalUse("FlaG"));
		
		assertTrue(obj.detectCapitalUse2("USA"));
		assertTrue(obj.detectCapitalUse2("leetcode"));
		assertTrue(obj.detectCapitalUse2("Google"));
		assertTrue(obj.detectCapitalUse2("g"));
		assertFalse(obj.detectCapitalUse2("FlaG"));
		
	}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值