LeetCode 简单操作 | 136. Single Number

来源:互联网 发布:网络借贷利息是多少 编辑:程序博客网 时间:2024/03/29 07:12
/* * Leetcode136. Single Number * Funtion: Given an array of integers, every element appears twice except for one. Find that single one. * Author: LKJ * Date:2016/7/19*/#include <iostream>#include <vector>using namespace std;class Solution {public:    int singleNumber(vector<int>& nums) {        int length = nums.size();        int result = 0 ;        for (int i=0; i<length; i++)        {            result ^= nums[i];//用异或找不同        }        return result;    }};int main(){    int myarr[5] = {1,1,3,3,4};    vector<int> myin(myarr,myarr+5);    int myout;    Solution SA;    //cout << "Please Enter" << endl;    //cin >> myin;    myout = SA.singleNumber(myin);    cout << myout << endl;    return 0;}
0 0