腾讯2020校园招聘-后台&综合-第二次笔试
第一题 AC 100%
package middleLinkCode; import java.util.Scanner; public class tx1 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc=new Scanner(System.in); int n=sc.nextInt(); int m=sc.nextInt(); int[]a=new int[n]; int[]b=new int[m]; int aeven=0,aodd=0; int beven=0,bodd=0; for(int i=0;i<n;i++){ a[i]=sc.nextInt(); if(a[i]%2==1) aeven++; else aodd++; } for(int j=0;j<m;j++){ b[j]=sc.nextInt(); if(b[j]%2==1) beven++; else bodd++; } int temp=Math.min(aeven, bodd)+Math.min(aodd, beven); System.out.println(temp); sc.close(); } }
第二题 AC 100%
package middleLinkCode; import java.util.Arrays; import java.util.Scanner; public class tx2 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int n = sc.nextInt(); long[] a = new long[n]; long[] b = new long[n]; long[] c = new long[n]; long sum = 0, ans = 0; for (int i = 0; i < n; i++) { a[i] = sc.nextLong(); b[i] = sc.nextLong(); sum += b[i] * n - a[i]; c[i] = a[i] - b[i]; } Arrays.sort(c); for (int i = 1; i <= n; i++) { ans += c[n - i] * i; } System.out.println(ans + sum); sc.close(); } }第四题 AC 100%
package middleLinkCode; import java.util.*; public class tx4 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] d = new int[n + 2]; int[] l = new int[n + 2]; int[] r = new int[n + 2]; long[] sum = new long[n + 2]; for (int i = 1; i <= n; i++) { d[i] = sc.nextInt(); sum[i] = sum[i - 1] + d[i]; l[i] = r[i] = i; } d[0] = d[n + 1] = -100000; for (int i = 1; i <= n; i++) while (d[l[i] - 1] >= d[i]) l[i] = l[l[i] - 1]; for (int i = n; i >= 1; i--) while (d[r[i] + 1] >= d[i]) r[i] = r[r[i] + 1]; long res = 0; for (int i = 1; i <= n; i++) { long t = d[i] * (sum[r[i]] - sum[l[i] - 1]); if (t > res) { res = t; } } System.out.println(res); sc.close(); } }其他 未做 不知道能不能再给个面试的机会