1044.Shopping in Mars Java

Su4iky

已于 2024-02-20 11:51:32 修改

阅读量148

点赞数 3

文章标签： java 算法开发语言

于 2024-02-19 18:18:20 首次发布

本文链接：https://blog.csdn.net/qq_56691739/article/details/136176084

版权

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        int n=scanner.nextInt();
        int m=scanner.nextInt();
        int val[]=new int[n];
        ArrayList<Integer>left=new ArrayList<>();
        ArrayList<Integer>right=new ArrayList<>();
        int min_pay=Integer.MAX_VALUE;
        for (int i=0;i<n;i++){
            val[i]= scanner.nextInt();
        }
        for (int i=0,j=0,sum=0;j<n||sum>=m;){
            if (sum<m){
                sum+=val[j];
                j++;
            } else if (sum>m) {
                if (sum<min_pay){
                    min_pay=sum;
                }
                sum-=val[i];
                i++;
            } else if (sum==m) {
                left.add(i+1);
                right.add(j);
                sum-=val[i];
                i++;
            }
        }
        if (left.size()>0){//左右size相等
            for (int i=0;i< left.size();i++){
                System.out.println(left.get(i)+"-"+ right.get(i));
            }
        }
        else {//没有刚好符合的情况
            m=min_pay;
            for (int i=0,j=0,sum=0;j<n||sum>=m;){
                if (sum<m){
                    sum+=val[j];
                    j++;
                } else if (sum>m) {
                    if (sum<min_pay){
                        min_pay=sum;
                    }
                    sum-=val[i];
                    i++;
                } else if (sum==m) {
                    left.add(i+1);
                    right.add(j);
                    sum-=val[i];
                    i++;
                }
            }
            for (int i=0;i< left.size();i++){
                System.out.println(left.get(i)+"-"+ right.get(i));
            }
        }
    }
}