Leetcode: Single Number
来源:互联网 发布:java中空格怎么表示 编辑:程序博客网 时间:2024/06/08 07:06
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 result = 0;
for (int i = 0; i < n; ++i) {
result ^= A[i];
}
return result;
}
};
=======================第二次=====================
class Solution {public: int singleNumber(int A[], int n) { int result = 0; for (int i = 0; i < n; ++i) { result ^= A[i]; } return result; }};
0 0
- leetcode Single Number & Single Number ||
- [LeetCode] Single Number
- Leetcode: Single Number
- Leetcode Single Number
- Single Number - leetcode
- Single Number II - leetcode
- Leetcode: Single Number II
- 【LeetCode】Single Number
- [LeetCode] Single Number II
- LeetCode: Single Number II
- LeetCode: Single Number
- leetcode -- Single Number II
- [leetcode]Single Number II
- [LeetCode] Single Number II
- [LeetCode]Single Number
- Leetcode Single Number
- 【leetcode】Single Number
- 【leetcode】Single Number II
- Eclipse使用技巧总结(三)
- 超级求爱程序--为我们的程序工作找乐子
- 【iOS】用Layer创建一个三维模型以及拖动
- Ibatis调用存储过程实现增删改以及分页查询
- 增加内核系统调用
- Leetcode: Single Number
- 13年12月校赛总结
- 抽象类和接口 引用整理。
- Android Service学习之本地服务
- arm寻址与简单指令
- 求坛子网友们提供一个性价比高的PCB 工厂,S5PV210 的金手指核心板要拿去批量生产。
- linux学习过程中所需要看的一些书籍
- Knuth-Morris-Pratt algorithm
- iOS组件之UILabel