zoukankan      html  css  js  c++  java
  • leetcode 217. Contains Duplicate

    Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.

    用sort或则 unorder_map,map 什么的都可以吧

    class Solution {
    public:
        bool containsDuplicate(vector<int>& nums) {
            sort(nums.begin(), nums.end());
            if (nums.size() <= 1) return false;
            for (int i = 1; i < nums.size(); ++i) {
                if ((nums[i] ^ nums[i - 1]) == 0) {
                    return true;
                } 
            }
            return false;
        }
    };
    class Solution {
    public:
        bool containsDuplicate(vector<int>& nums) {
            unordered_map<int, int> umap;
            for(int i=0;i<nums.size();i++){
                if(umap.find(nums[i]) != umap.end())
                    return true;
                umap[nums[i]] = 1;
            }
            return false;
        }
    };
  • 相关阅读:
    首尾相连一维数组的最大子数组和
    二柱子——在线答题
    二维数组求最大值
    最大子数组和 10.11作业
    最大子数组

    异常
    面向对象2
    面向对象1
    java数据类型
  • 原文地址:https://www.cnblogs.com/pk28/p/7251045.html
Copyright © 2011-2022 走看看