CodeSignal-Arrays(2):firstNotRepeatingCharacter

Question

Given a string s consisting of small English letters, find and return the first instance of a non-repeating character in it. If there is no such character, return '_'.

Example

  • For s = "abacabad", the output should be
    solution(s) = 'c'.

    There are 2 non-repeating characters in the string: 'c' and 'd'. Return c since it appears in the string first.

  • For s = "abacabaabacaba", the output should be
    solution(s) = '_'.

    There are no characters in this string that do not repeat.

Input/Output

  • [execution time limit] 3 seconds (java)

  • [memory limit] 1 GB

  • [input] string s

    A string that contains only lowercase English letters.

    Guaranteed constraints:
    1 ≤ s.length ≤ 105.

  • [output] char

    The first non-repeating character in s, or '_' if there are no characters that do not repeat.

Answer java

char solution(String str) {
if(str==null)
            return '_';
        char[] chars=str.toCharArray();
        LinkedHashMap<Character,Integer> hashMap=new LinkedHashMap<Character,Integer>();
        for(char item:chars){
            if(hashMap.containsKey(item))
                hashMap.put(item, hashMap.get(item)+1);
            else
                hashMap.put(item, 1);
            
        }
        for(char key:hashMap.keySet()){
            if(hashMap.get(key)==1)
                return key;
        }
        return '_';

}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值