leetcode 520. Detect Capital(char,arraylist)

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:

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 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

题意:

检测单词是否符合标准,首字母大写,或者全大写,或者全小写就符合,其他不符合

思路:

先将单词转换成小写,对比两个单词中不一样的字母,用ArrayList记录索引值,根据索引判断是否符合标准

知识点:
  1. char数组声明有[]
  2. char数组的长度是length,没有()
  3. ArrayList初始化:ArrayList<Integer> index = new ArrayList<Integer>();,注意构造函数也要有数据类型
  4. ArrayList的实际长度是size()
  5. ArrayList得到索引值是用get()方法
class Solution {
    public boolean detectCapitalUse(String word) {
        char[] word2 = word.toLowerCase().toCharArray();
        int len = word2.length;//无()
        ArrayList<Integer> index = new ArrayList<Integer>();
        for(int i=0;i<len;i++){
            if(word2[i] != word.charAt(i)){
                index.add(i);
            }
        }
        int lenIndex = index.size();
        if((lenIndex == 0)||((lenIndex==1)&&(index.get(0)==0))||(lenIndex == len)){
            return true;
        }else{
            return false;
        }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值