华为机试真题 java 实现【最大化控制资源成本】【100%通过率】【2022.11 Q4 新题】

流量留

已于 2024-09-26 18:17:34 修改

阅读量6

点赞数

分类专栏：机考文章标签： java 算法 jvm

于 2023-03-05 14:13:47 首次发布

本文链接：https://blog.csdn.net/xintai1999/article/details/129345537

版权

机考专栏收录该内容

43 篇文章 0 订阅

订阅专栏


import java.util.*;
import java.util.stream.Collectors;
 
class Main {
    public static void main(String[] args) {
        // 输入处理
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        Integer[][] ranges = new Integer[n][3];
        for (int i = 0; i < n; i++) {
            ranges[i][0] = in.nextInt();
            ranges[i][1] = in.nextInt();
            ranges[i][2] = in.nextInt();
        }
 
        // 区间排序
        Arrays.sort(ranges, (a, b) -> a[0] - b[0]);
 
        HashSet<Integer> points = new HashSet<>();
        for (Integer[] se : ranges) {
            points.add(se[0]);
            points.add(se[1]);
        }
    
        // 点排序
        Integer[] points_arr = points.toArray(new Integer[0]);
        Arrays.sort(points_arr, (a, b) -> a - b);
    
        int result = 0;
        HashSet<Integer> ignore = new HashSet<>();
    
        //遍历每一个点
        for (Integer point : points_arr) {
            int current_count = 0;
            // 判断这个点是否在此区间内
            for (int i = 0; i < ranges.length; i++) {
                if (ignore.contains(i)){
                    continue;
                }
        
                if (point < ranges[i][0]){
                    break;
                }
                else if (point < ranges[i][1]){
                    current_count += ranges[i][2];
                } 
                else{
                    ignore.add(i);
                } 
            }
        
            result = Math.max(result, current_count);
        }
        System.out.println(result);
    }
 
 
}

新思路


import java.util.Scanner;
import java.util.*;
import java.util.stream.Collectors;
import java.math.BigInteger;
import java.util.stream.Stream;
 
class Main {
    public static void main(String[] args) {
        // 输入处理
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[][] ranges = new int[n][3];
        for (int i = 0; i < n; i++) {
            ranges[i][0] = in.nextInt();
            ranges[i][1] = in.nextInt();
            ranges[i][2] = in.nextInt();
        }
 
        System.out.println(minMeetingRooms(ranges));
    }
 
    public static int minMeetingRooms(int[][] ranges) {
        Arrays.sort(ranges, (a, b) -> a[0] - b[0]);
        PriorityQueue<Integer[]> pq = new PriorityQueue<>((a, b) -> a[0] - b[0]);
    
        int res = 0;
        int temp_res = 0;
        for (int i = 0; i < ranges.length; i ++ ) {
            while (pq.size() > 0) {
                Integer[] top = pq.peek();
        
                if (top[0] < ranges[i][0]) {
                    Integer[] poll = pq.poll();
                    temp_res -= poll[1];
                } else {
                    break;
                }
            }
        
            pq.offer(new Integer[] {ranges[i][1], ranges[i][2]});
            temp_res += ranges[i][2];
        
            if (temp_res > res) {
                res = temp_res;
            }
        }
        return res;
    }
 
}