zoukankan      html  css  js  c++  java
  • Reverse Pairs

    For an array A, if i < j, and A [i] > A [j], called (A [i], A [j]) is a reverse pair.
    return total of reverse pairs in A.

    Example

    Given A = [2, 4, 1, 3, 5] , (2, 1), (4, 1), (4, 3) are reverse pairs. return 3

    Solution 1: the same as the leetcode question 315. Count of Smaller Numbers After Self

    class Solution {
    public:
        /**
         * @param A an array
         * @return total of reverse pairs
         */
        long long reversePairs(vector<int>& A) {
            // Write your code here
            long long res=0;
            vector<int> t;
            for (int i=A.size()-1;i>=0;i--){
                int index=lower_bound(t.begin(),t.end(),A[i])-t.begin();
                t.insert(t.begin()+index,A[i]);
                res+=index;
            }
            return res;
        }
    };
     
  • 相关阅读:
    Qt实现模糊搜索
    Qt解析多级xml文件
    insert into
    Git忽略规则(.gitignore配置)不生效原因和解决
    搭建vue开发环境
    表单
    事件处理
    列表渲染
    条件渲染
    class与style绑定
  • 原文地址:https://www.cnblogs.com/anghostcici/p/7439922.html
Copyright © 2011-2022 走看看