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