Leetcode 136. Single Number | | Leetcode 136. Single Number 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution Simple Method 12345678910111213141516class Solution {public: int singleNumber(vector<int>& nums) { sort(nums.begin(), nums.end()); int i = 0; while(i < nums.size() - 1) { if(nums[i] == nums[i + 1]) { i += 2; } else { return nums[i]; } } return nums[nums.size() - 1]; }}; O(N) 12345678910class Solution {public: int singleNumber(vector<int>& nums) { int x = 0; for(int i = 0; i < nums.size(); i++) { x ^= nums[i]; } return x; }}; Reference https://leetcode.com/problems/single-number/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏