首页 > 代码库 > 【59】136. Single Number
【59】136. Single Number
136. Single Number
Description Submission Solutions Add to List
- Total Accepted: 191020
- Total Submissions: 360448
- Difficulty: Easy
- Contributors: Admin
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 res = 0; for(int num : nums){ res ^= num; } return res; } };
【59】136. Single Number
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。