codewars023: FInd the odd int

最新推荐文章于 2024-08-18 21:36:31 发布

weixin_34391854

最新推荐文章于 2024-08-18 21:36:31 发布

阅读量173

点赞数

文章标签： java python

原文链接：https://my.oschina.net/u/553266/blog/808311

版权

2019独角兽企业重金招聘Python工程师标准>>>

Instructions:

Given an array, find the int that appears an odd number of times.

There will always be only one integer taht appears an odd number of times.

//--https://www.codewars.com/kata/54da5a58ea159efa38000836/train/java
package codewars;
import java.util.*;
public class FindOdd{
  public static int findIt(int[] A){
    Map<Integer,Integer> map = new HashMap<Integer,Integer>();
    for(int x : A){
      if(map.containsKey(x)){
        map.put(x, map.get(x) + 1);
      }else{
        map.put(x, 1);
      }
    }
    for(Map.Entry<Integer,Integer> x : map.entrySet()){
      if(x.getValue() % 2 == 1){
        return x.getKey();
      }
    }
    return 0;
  }
}

转载于:https://my.oschina.net/u/553266/blog/808311