zoukankan      html  css  js  c++  java
  • leetcode@ [136/137] Single Number & Single Number II

    https://leetcode.com/problems/single-number/

    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) {
            if(nums.size() == 1) return nums[0];
            
            vector<int> bitNums(32, 0);
            
            int res = 0;
            for(int i=0;i<bitNums.size();++i) {
                for(int j=0;j<nums.size();++j) {
                    bitNums[i] += (nums[j] >> i) & 1;
                }
                res |= (bitNums[i] % 2) << i;
            }
            
            return res;        
        }
    };
    View Code

    https://leetcode.com/problems/single-number-ii/

    Given an array of integers, every element appears three times 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) {
            if(nums.size() == 1) return nums[0];
            
            vector<int> bitNums(32, 0);
            
            int res = 0;
            for(int i=0;i<32;++i) {
                for(int j=0;j<nums.size();++j) {
                    bitNums[i] += (nums[j] >> i) & 1;
                    cout << ((nums[j] >> i) & 1) << " ";
                }
                cout<<endl;
            }
            
            for(int i=0;i<bitNums.size();++i) {
                res += (bitNums[i] % 3) << i;
            }
            return res;
        }
    };
    View Code
  • 相关阅读:
    关于发布版本号管理
    WWF
    C#编码规范和命名规则
    使用正则表达式更改编译版本号
    .net2005登录控件
    读取web.config自定义配置节
    在SQL SERVER 2005 中使用XML
    CVSNT用户权限配置
    共享鼠标
    《Ajax基础教程》
  • 原文地址:https://www.cnblogs.com/fu11211129/p/4974469.html
Copyright © 2011-2022 走看看