[leetcode] Single Number
来源:互联网 发布:淘宝卖家说加微信返现 编辑:程序博客网 时间:2024/05/14 14:04
From : https://leetcode.com/problems/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?
class Solution {public: int singleNumber(vector<int>& nums) { if(nums.size() == 0) return 0; int result = nums[0], len=nums.size(); for(int i=1; i<len; i++) result ^= nums[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
- 【转】深圳的NB公司-四华一启
- 使用ANT打包Android应用
- leetcode Implement strStr()
- 中科院计算所培训中心三季度公开课安排
- 天声人語 20150608
- [leetcode] Single Number
- 你之所以是小散 是因为还有这些错误投资理念
- tomcat重启脚本
- Eclipse中如何快速查看jar包中 的class源码
- 什么才算是真正的编程能力?
- live555 源代码简单分析1:主程序
- 九度OJ-题目1522:包含min函数的栈
- Next Permutation
- java 数据格式相互转换