leetcode——136——Single Number
来源:互联网 发布:js 检测分辨率 编辑:程序博客网 时间:2024/06/04 18:27
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) { int n = nums.size(); if(n==0) return -1; int res=nums[0] ; for(int i=1;i<n;i++) { res = res^nums[i]; } return res; }};
0 0
- LeetCode — Single Number
- LeetCode—Single Number
- LeetCode——Single Number
- leetcode —— single number
- LeetCode——Single Number
- leetcode 136 —— Single Number
- LeetCode——136. Single Number&&137. Single Number II
- LeetCode OJ——Single Number
- LeetCode OJ——Single Number II
- LeetCode——Single Number(II)
- LeetCode——Single Number II
- leetcode 137 —— Single Number II
- LeetCode——Single Number III
- LeetCode——Single Number II
- leetcode——Single Number III
- Leetcode——136. Single Number
- LeetCode——136. Single Number
- LeetCode — Single Number 解题报告
- Jenkins入门系列
- sql server触发器
- Gradle DSL method not found: 'runProguard()'
- 学生管理系统map实现篇
- 51Nod-1066-Bash游戏
- leetcode——136——Single Number
- Android-启用系统相机拍摄图片并且显示
- Java读取properties文件中文乱码问题解决
- struts2动态方法调用
- Hadoop入门的五个进程的理解(二)
- 根据一个笔试题引出的思考
- Python nltk载入自己的中文语料库的两种方法 for Windows7
- CodeForces 552C:Vanya and Scales【技巧】
- hal层