时间限制：1秒 空间限制：32768K
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?
class Solution {
public:
int singleNumber(int A[], int n) {
int ones=0;
for(int i=0;i<n;i++){
int cur=A[i];
ones^=cur;
}
return ones;
}
};
运行时间：7ms
占用内存：476k
leetcode[https://leetcode-cn.com/problems/single-number/]...
时间限制：1秒 空间限制：32768K 题目描述 Given an array of integers, ever...
Single Num https://leetcode.com/problems/single-number/给定...
链接 https://leetcode-cn.com/problems/single-number/descrip...
题目链接 https://leetcode.com/problems/single-number/descript...
题目地址 https://leetcode.com/problems/single-number/[https:/...
题目： 题目地址：https://leetcode-cn.com/problems/single-number/ ...
题目描述 https://leetcode-cn.com/problems/single-number/ 解 思路...
1. 题目 https://leetcode-cn.com/problems/single-number/ 给定一...
原题地址：https://leetcode-cn.com/problems/single-number/ 给定一个...
本文标题：single-number
本文链接：https://www.haomeiwen.com/subject/pbcaoqtx.html
网友评论