23届秋招美团笔试算法题

浅浅的花香味﹌ 2024-04-06 10:26 98阅读 0赞

import java.util.Arrays;
    import java.util.Scanner;
    
    //23届秋招美团笔试第一题：暴力(80%)
    public class Main4 {
    
    	public static void f4(int[] arr) {
    		int min=999999;
    		int sum=0;
    		for (int i = 0; i < arr.length; i++) {
    			for (int j = 0; j < arr.length; j++) {
    				if(j!=i) {
    					sum+=Math.abs(arr[i]+i-j-arr[j]);
    				}
    			}
    			min=Math.min(min, sum);
    			sum=0;
    			
    			for (int j = 0; j < arr.length; j++) {
    				if(j!=i) {
    					sum+=Math.abs(arr[i]+j-i-arr[j]);
    				}
    			}
    			min=Math.min(min, sum);
    			sum=0;
    		}
    		System.out.println(min);
    	}
    	
    	public static void main(String[] args) {
    		Scanner sc=new Scanner(System.in);
    		int n=sc.nextInt();
    		int[] arr=new int[n];
    		for (int i = 0; i < n; i++) {
    			arr[i]=sc.nextInt();
    		}
    		Arrays.sort(arr);
    		f4(arr);
    	}
    
    }

import java.util.Scanner;
    
    //23届秋招美团笔试第二题：暴力(80%)
    public class Main5 {
    
    	public static void f5(int x,int y,int[] arr) {
    		int sum=0;
    		
    		for (int i = 0; i < arr.length; i++) {
    			for (int j = i+1; j < arr.length; j++) {
    				if(arr[i]+arr[j]>=x&&arr[i]*arr[j]>=y) {
    					sum++;
    				}
    			}
    		}
    		System.out.println(sum);
    	}
    	
    	public static void main(String[] args) {
    
    		Scanner sc=new Scanner(System.in);
    		int n=sc.nextInt(),x=sc.nextInt(),y=sc.nextInt();
    		int[] arr=new int[n];
    		for (int i = 0; i < n; i++) {
    			arr[i]=sc.nextInt();
    		}
    		f5(x,y,arr);
    	}
    	
    }

import java.util.LinkedList;
    import java.util.List;
    import java.util.Scanner;
    
    //23届秋招美团笔试第三题：暴力(100%)
    public class Main6 {
    
    	public static void f6(int n,List<Integer> list1,List<Integer> list2) {
    		int sum = 0;
    		int now=1;
    		while(now!=n+1) {
    			if(list1.contains(now)) {
    				for (int i = list1.size()-1; i >=0; i--) {
    					int mid=list1.get(i);
    					if(mid!=now) {
    						list2.add(mid);
    						list1.remove(i);
    						sum++;
    					}else {
    						now++;
    						list1.remove(i);
    						sum++;
    						break;
    					}
    				}
    			}else {
    				for (int i = list2.size()-1; i >=0; i--) {
    					int mid=list2.get(i);
    					if(mid!=now) {
    						list1.add(mid);
    						list2.remove(i);
    						sum++;
    					}else {
    						now++;
    						list2.remove(i);
    						sum++;
    						break;
    					}
    				}
    			}
    		}
    		System.out.println(sum);
    	}
    
    	public static void main(String[] args) {
    
    		Scanner sc = new Scanner(System.in);
    		int n = sc.nextInt(), x = sc.nextInt(), y = sc.nextInt();
    		List<Integer> list1=new LinkedList<Integer>();
    		List<Integer> list2=new LinkedList<Integer>();
    		for (int i = 0; i < x; i++) {
    			list1.add(sc.nextInt());
    		}
    		for (int i = 0; i < y; i++) {
    			list2.add(sc.nextInt());
    		}
    		f6(n,list1,list2);
    	}
    
    }

import java.util.Scanner;
    
    //23届秋招美团笔试第五题：树暴力(?%)
    public class Main7 {
    
    	public static void f7(int n,int[] arr1,int[] arr2,int[] vals) {
    		
    		for (int j = 1; j < n; j++) {
    			for (int k = 0; k < n-1; k++) {
    				if(arr2[k]==j+1) {
    					if(vals[arr1[k]-1]>=vals[j]) {
    						System.out.println(-1);
    						return;
    					}
    				}
    			}
    		}
    		System.out.println(vals[0]);
    		
    	}
    	
    	public static void main(String[] args) {
    		Scanner sc = new Scanner(System.in);
    		int t = sc.nextInt();
    		for (int i = 0; i < t; i++) {
    			int n = sc.nextInt();
    //			sc.nextLine();//消换行
    			
    			int[] arr1=new int[n-1];
    			int[] arr2=new int[n-1];
    			for (int j = 0; j < n-1; j++) {
    				arr1[j]=sc.nextInt();
    			}
    			for (int j = 0; j < n-1; j++) {
    				arr2[j]=sc.nextInt();
    			}
    			int[] vals=new int[n];
    			for (int j = 0; j < n; j++) {
    				vals[j]=sc.nextInt();
    			}
    			
    			f7(n,arr1, arr2, vals);
    		}
    
    	}
    
    }
    
    //测试数据
    //2
    //3
    //1 1
    //2 3
    //7 6 8
    //3
    //1 1
    //2 3
    //7 8 9
    //