首页 > 代码库 > LeetCode Single Number II
LeetCode Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
public class Solution { public int singleNumber(int[] A) { HashMap<Integer, Integer> map = new HashMap<>(); int singnum=0; for (int i = 0; i < A.length; i++) { if (map.containsKey(A[i])) { map.put(A[i], map.get(A[i])+1); }else { map.put(A[i],1); } if (map.get(A[i])==3) { map.remove(A[i]); } } for (Integer i : map.keySet()) { singnum=i; } return singnum; }}
LeetCode Single Number II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。