zoukankan      html  css  js  c++  java
  • leetcode 136 Single Number, 260 Single Number III

    leetcode 136. 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(const vector<int>& nums) const {
            int result = 0;
            
            for(auto e : nums)
            {
                result ^= e;
            }
            
            return result;
        }
    };
    View Code

    leetcode 137. 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?

    解题思路:

      利用 unordered_map 模拟 hash 表,记录元素出现过的次数 pair<number, times>

    代码如下:

    class Solution {
    public:
        int singleNumber(const vector<int>& nums) {
            unordered_map<int, unsigned> m;
            
            for(auto e : nums)
            {
                m[e]++;
            }
            
            for(auto e : m)
            {
                if(e.second == 1)   return e.first;
            }
            
            return -1;
        }
    };
    View Code

    leetcode 260. Single Number III

    Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.

    For example:

    Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].

    Note:

    1. The order of the result is not important. So in the above example, [5, 3] is also correct.
    2. Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?

    解题思路:

      把所有数存入哈希表,数值大小作为 key ,该数出现的次数——value——每次累加。

      然后再遍历哈希表,把 value == 1 的 key 取出来即是本题答案。

    代码如下:

    class Solution {
    public:
        vector<int> singleNumber(const vector<int>& nums) {
            unordered_map<int, unsigned> m;
            
            for(auto e : nums)
            {
                m[e]++;
            }
            
            vector<int> v;
            
            for(auto e : m)
            {
                if(e.second == 1)
                {
                    v.push_back(e.first);
                }
            }
            
            return v;
        }
    };
    View Code
  • 相关阅读:
    做SQL解析时遇到的问题
    SqlAnalyzer1.00源码
    用于测试SqlAnalyzer1.00的十七个测试用例
    XmlAnalyzer1.00 源码
    用于测试XmlAnalyzer 1.00版的八个测试用例
    JsonAnalyzer2 1.01版
    用于测试 JsonAnalyzer2 1.01版的测试用例
    按照BNF语法重新写就的JsonAnalyzer2
    递归向下解析算术表达式(四)
    允许Sublime编辑器在Ubuntu上输入中文
  • 原文地址:https://www.cnblogs.com/fengyubo/p/5229882.html
Copyright © 2011-2022 走看看