OJ-0716

参考

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();

        List<Pair> arr = new ArrayList<>();
        int l, r;

        while (scanner.hasNextInt()) {
            l = scanner.nextInt();
            r = scanner.nextInt();
            arr.add(new Pair(l, l + r - 1));
        }

        Collections.sort(arr); // 按照左端点进行排序
        int m = arr.size();

        if (!check(arr)) {
            System.out.println(-1);
        } else {
            int pos = -1, diff = (int) 1e9;

            for (int i = 0; i < m; i++) {
                if (i == 0) {
                    if (arr.get(i).first >= n && Math.abs(arr.get(i).first - n) < diff) {
                        pos = 0;
                        diff = Math.abs(arr.get(i).first - n);
                    }
                } else if (arr.get(i).first - arr.get(i - 1).second > n && Math.abs(arr.get(i).first - arr.get(i - 1).second - n) < diff) {
                    pos = arr.get(i - 1).second + 1;
                    diff = Math.abs(arr.get(i).first - arr.get(i - 1).second - n);
                    break;
                }
            }

            if (99 - arr.get(m - 1).second >= n && Math.abs(99 - arr.get(m - 1).second - n) < diff) {
                pos = arr.get(m - 1).second + 1;
            }
            System.out.println(pos);
        }
    }

    static class Pair implements Comparable<Pair> {
        int first, second;

        public Pair(int first, int second) {
            this.first = first;
            this.second = second;
        }

        @Override
        public int compareTo(Pair other) {
            return Integer.compare(this.first, other.first);
        }
    }

    private static boolean check(List<Pair> arr) {
        int m = arr.size();
        for (int i = 0; i < m; i++) {
            int x = arr.get(i).first;
            int y = arr.get(i).second;
            // 判断是否满足条件:x和y非负,且x < 100,y < 100,且x小于y
            if (x < 0 || y < 0 || x >= 100 || y >= 100 || x > y) {
                System.out.println(x + " " + y);
                return false;
            }
            // 判断是否有重叠区间
            if (i > 0 && x <= arr.get(i - 1).second) {
                return false;
            }
        }
        return true;
    }
}
``
  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值