leetcode解题之136 #Single Number Java版（只出现一次的数字）

最新推荐文章于 2024-07-21 22:27:18 发布

mine_song

最新推荐文章于 2024-07-21 22:27:18 发布

阅读量1.6k

点赞数 1

本文链接：https://blog.csdn.net/mine_song/article/details/62041456

版权

136. Single Number

Given an array of integers, every element appearstwice except for one. Find that single one.

Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

只出现一次的数字，其他全部两次，能不使用额外的空间吗？

使用map：

public  int singleNumber(int[] nums) {
		int i = 0;
		int j = nums.length - 1;
		Map<Integer, Integer> map = new HashMap<>();
		while (i <= j) {
			if (map.containsKey(nums[i]))
				map.put(nums[i], map.get(nums[i])+1);
			else
				map.put(nums[i], 1);
			i++;
			
		}
		i = 0;
		while (i <= j) {
			if (map.get(nums[i]) &#