LeetCode-493. Reverse Pairs

目录

题目描述

解题思路

【C++】

【Java】


https://leetcode.com/problems/reverse-pairs/description/https://leetcode.com/problems/reverse-pairs/description/

题目描述

Given an integer array nums, return the number of reverse pairs in the array.

A reverse pair is a pair (i, j) where:

  • 0 <= i < j < nums.length and
  • nums[i] > 2 * nums[j].

Example 1:

复制代码
Input: nums = [1,3,2,3,1]
Output: 2
Explanation: The reverse pairs are:
(1, 4) --> nums[1] = 3, nums[4] = 1, 3 > 2 * 1
(3, 4) --> nums[3] = 3, nums[4] = 1, 3 > 2 * 1

Example 2:

复制代码
Input: nums = [2,4,3,5,1]
Output: 3
Explanation: The reverse pairs are:
(1, 4) --> nums[1] = 4, nums[4] = 1, 4 > 2 * 1
(2, 4) --> nums[2] = 3, nums[4] = 1, 3 > 2 * 1
(3, 4) --> nums[3] = 5, nums[4] = 1, 5 > 2 * 1

Constraints:

  • 1 <= nums.length <= 5 * 104
  • -231 <= nums[i] <= 231 - 1

解题思路

【C++】

cpp 复制代码
class Solution {
private:
    vector<int> indexes;
    vector<int> tmpIdxes;
    int ret = 0;

    void merge(vector<int>& nums, int start, int mid, int end) {
        int p1 = start, p2 = mid + 1, cur = start;
        while (p1 <= mid && p2 <= end) {
            while (p2 <= end && (long long) nums[indexes[p1]] <= (long long) nums[indexes[p2]] * 2) {p2++;}
            ret += end - p2 + 1;
            p1++;
        }
        p1 = start, p2 = mid + 1;
        while (p1 <= mid && p2 <= end) {tmpIdxes[cur++] = nums[indexes[p1]] > nums[indexes[p2]] ? indexes[p1++] : indexes[p2++];}
        while (p1 <= mid) {tmpIdxes[cur++] = indexes[p1++];}
        while (p2 <= end) {tmpIdxes[cur++] = indexes[p2++];}
        for (int i = start; i <= end; i++) {indexes[i] = tmpIdxes[i];}
    }

    void mergeSort(vector<int>& nums, int start, int end) {
        if (start < end) {
            int mid = start + (end - start) / 2;
            mergeSort(nums, start, mid);
            mergeSort(nums, mid + 1, end);
            merge(nums, start, mid, end);
        }
    }
public:
    int reversePairs(vector<int>& nums) {
        if (nums.size() < 2) {return 0;}
        indexes.resize(nums.size());
        tmpIdxes.resize(nums.size());
        for (int i = 0; i < nums.size(); i++) {indexes[i] = i;}
        ret = 0;
        mergeSort(nums, 0, nums.size() - 1);
        return ret;
    }
};

【Java】

java 复制代码
class Solution {
    private int[] index;
    private int[] tmpIndex;
    private int ans;
 
    private void merge(int[] nums, int start, int mid, int end) {
        int p1 = start, p2 = mid + 1, cur = start;
        while (p1 <= mid && p2 <= end) {
            while (p2 <= end && nums[index[p1]] <= (long) nums[index[p2]] * 2) {p2++;}
            ans += end - p2 + 1;
            p1++;
        }
        p1 = start; p2 = mid + 1;
        while (p1 <= mid && p2 <= end) {
            if (nums[index[p1]] > nums[index[p2]]) {tmpIndex[cur++] = index[p1++];}
            else {tmpIndex[cur++] = index[p2++];}
        }
        while (p1 <= mid) {tmpIndex[cur++] = index[p1++];}
        while (p2 <= end) {tmpIndex[cur++] = index[p2++];}
        for (int i = start; i <= end; i++) {index[i] = tmpIndex[i];}
    }
 
    private void mergeSort(int[] nums, int start, int end) {
        if (start < end) {
            int mid = start + (end - start) / 2;
            mergeSort(nums, start, mid);
            mergeSort(nums, mid + 1, end);
            merge(nums, start, mid, end);
        }
    }

    public int reversePairs(int[] nums) {
        index = new int[nums.length];
        tmpIndex = new int[nums.length];
        ans = 0;
        for (int i = 0; i < nums.length; i++) {index[i] = i;}
        mergeSort(nums, 0, nums.length - 1);
        return ans;
    }
}
相关推荐
未来之窗软件服务1 小时前
自己写算法(九)网页数字动画函数——东方仙盟化神期
前端·javascript·算法·仙盟创梦ide·东方仙盟·东方仙盟算法
豐儀麟阁贵1 小时前
基本数据类型
java·算法
乐迪信息3 小时前
乐迪信息:基于AI算法的煤矿作业人员安全规范智能监测与预警系统
大数据·人工智能·算法·安全·视觉检测·推荐算法
hsjkdhs4 小时前
C++之多层继承、多源继承、菱形继承
开发语言·c++·算法
立志成为大牛的小牛4 小时前
数据结构——十七、线索二叉树找前驱与后继(王道408)
数据结构·笔记·学习·程序人生·考研·算法
星空下的曙光4 小时前
Node.js crypto模块所有 API 详解 + 常用 API + 使用场景
算法·node.js·哈希算法
StarPrayers.6 小时前
旅行商问题(TSP)(2)(heuristics.py)(TSP 的两种贪心启发式算法实现)
前端·人工智能·python·算法·pycharm·启发式算法
爱吃橘的橘猫6 小时前
嵌入式系统与嵌入式 C 语言(2)
c语言·算法·嵌入式
235166 小时前
【LeetCode】146. LRU 缓存
java·后端·算法·leetcode·链表·缓存·职场和发展
weixin_307779137 小时前
使用Python高效读取ZIP压缩文件中的UTF-8 JSON数据到Pandas和PySpark DataFrame
开发语言·python·算法·自动化·json