zoukankan      html  css  js  c++  java
  • qsort C++ VS2013 leetcode

    class Solution {
    private:
        static int compare(const void * a, const void * b)
        {
            return (*(int*)a - *(int*)b);
        }
    
    public:
    int majorityElement(vector<int>& nums) {
        qsort(&nums[0], nums.size(), sizeof(int), &Solution::compare);
        return nums[nums.size() / 2];
    }
    };
  • 相关阅读:
    8.25
    8.24
    8.23
    8.22
    8.21
    8.20
    8.19
    8.18
    8.17
    8.16
  • 原文地址:https://www.cnblogs.com/jasonbu/p/4456325.html
Copyright © 2011-2022 走看看