汇丰银行的工作前景怎么样？

第一题import java.util.*;public class test {    public static void main(String[] args) {        Scanner in=new Scanner(System.in);        int n=in.nextInt();        int k=in.nextInt();        int[] a=new int[100005];        int ai;        int st=100005,ed=0;        for(int i=0;i<n;i++){             ai=in.nextInt();             a[ai]=1;             if(i==0) st=ai;             if(i==n-1) ed=ai;        }        int moreDay=k-n,ans=0,kDay=0;        TreeMap<Integer,Integer> kDayMap=new TreeMap<>();        for(int i=st-1;i<=ed+1;i++){            if(a[i]==0&&a[i+1]==1) {                ans++;                if(i<=st) continue;                kDay++;                if(kDayMap.containsKey(kDay)){                    kDayMap.put(kDay,kDayMap.get(kDay)+1);                }else kDayMap.put(kDay,1);//                System.out.println("day:"+i+"kDay:"+kDay);                kDay=0;            }            else if(a[i]==1&&a[i+1]==0) {                ans++;            }            else if(a[i]==0) kDay++;        }        Set<Integer> kDaySet=kDayMap.keySet();//        System.out.println(kDaySet+"/"+ans+"/"+moreDay);        for(int key:kDaySet){//            System.out.println(key);//            System.out.println(kDayMap.get(key));            int value=kDayMap.get(key);            if(key*value<=moreDay){                moreDay-=key*value;                ans-=value*2;            }else {                ans-=(moreDay/key)*2;                moreDay=0;            }            if(moreDay==0) break;//            System.out.println("key:"+key+" value:"+value+" moreday:"+moreDay+" ans:"+ans);        }        System.out.println(ans);//        System.out.println(moreDay);//        System.out.println(kDayMap);        in.close();    }}第二题来不及做打表#牛客创作赏金赛#

1.字符不重复的最小次数题意给你一个长度为N的字符串，你可以删除任意位置的字符，删除后，该字符的左右字符会成为新的邻居，问需要删除多少个字符，可以是的每个字符的邻居不相同。思路比较简单的写法是用栈模拟，从前往后依次将字符加入栈中，如果和栈顶元素不相同，则入栈。相同则出栈。代码 import java.util.Scanner; public class A { static int maxn = 50 + 10; //数据范围 static char[] stack = new char[maxn]; static char[] chars; static i...

2025届春招笔试题1-软件开发方向 编程第一题```import java.util.ArrayList;import java.util.Comparator;import java.util.List;import java.util.Scanner;/***  @author Hertz*  @date 2025.3.12* */public class Main {    public static void main(String[] args) {        //接收操作        int ans=0;        Scanner sc=new Scanner(System.in);        int n=sc.nextInt();        int k=sc.nextInt();        k=k-n;//记录除去好日子剩下的天数        ans=n*2;        int []date=new int[n];        for(int i=0;i<n;i++){            date[i]=sc.nextInt();        }        //记录好日子之间相隔的天数        List<Integer> list=new ArrayList<>();        for(int i=1;i<n;i++){                list.add(date[i]-date[i-1]-1);        }        list.sort(new Comparator<Integer>() {   //对记录进行由小到大的排列            @Override            public int compare(Integer o1, Integer o2) {                return o1-o2;            }        });        int j=0;        //判断剩下天数是否足以度过相隔的天数        while(j<list.size()&&k>=list.get(j)){            k-=list.get(j);            j++;            ans-=2;        }        System.out.println(ans);    }}```纯蒻苟，大佬勿喷#小米##春招##小米笔试#

算法题不💊折磨我哇#小米求职进展汇总#