Leetcode 136. Single Number
来源:互联网 发布:php 5.2.5 win32.zip 编辑:程序博客网 时间:2024/05/16 09:02
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?
s思路:
1. 这道题遇到过! 不用内存,那就是一直做xor运算,相同的数xor等于0,最后只剩下the single number.
2. 这道题就是利用两个数异或的性质,基本也就是一道数学题!
class Solution {public: int singleNumber(vector<int>& nums) { int res=0; for(int i=0;i<nums.size();i++){ res^=nums[i]; } return res; }};
0 0
- LeetCode 136. Single Number
- [Leetcode] 136. Single Number
- LeetCode 136. Single Number
- 【leetcode】136. Single Number
- 【LeetCode】136. Single Number
- Leetcode 136. Single Number
- leetcode 136. Single Number
- leetcode 136. Single Number
- 136. Single Number LeetCode
- LeetCode 136. Single Number
- LeetCode 136. Single Number
- [LeetCode]136. Single Number
- LeetCode 136. Single Number
- LeetCode *** 136. Single Number
- [LeetCode]136. Single Number
- LeetCode--136. Single Number
- 【leetcode】136. Single Number
- leetcode-136. Single Number
- 利用XML传输数据
- 多线程通信
- 2017/01/25
- spring笔记
- 对于后台订单购物流程的API开发小结
- Leetcode 136. Single Number
- TexLive支持中文问题
- 【JAVA学习】——J2SE总结
- Hive 分桶表
- 自动扫福脚本(Android版)
- 一边搭建一边理解MongoDB副本集(副本集协议版本)
- 2017/02/04
- c++程序的运行
- 矩阵的迹