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?
给定一个整数数组，里面只有一个数只出现一次，其余的数都出现两次，找出只出现一次的数。
采用异或运算^
a ^ a = 0
a ^ 0 = a
a ^ b ^ c = a ^ (b ^ c)
因此所有数进行异或，最终得到的就是只出现一次的数
func singleNumber(nums []int) int {
var ret int
ret = 0
for _,v := range nums {
ret = ret ^ v
}
return ret
}
136. Single Number https://leetcode.com/problems/single-n...
题目 Given an array of integers, every element appears twic...
Leetcode: 136. Single NumberGiven a non-empty array of in...
Given an array of integers, every element appears twice e...
136. 只出现一次的数字[https://leetcode-cn.com/problems/single-num...
D51 136. Single Number 题目链接 136. Single Number 题目分析 返回给定数...
136. Single Number Description Given a non-empty array of...
Given an array of integers, every element appears twice e...
Given an array of integers, every element appears twice e...
Given an array of integers, every element appears twice e...
本文标题：[LeetCode By Go 16]136. Single N
本文链接：https://www.haomeiwen.com/subject/lpjgrxtx.html
网友评论