shopee校招产品一面8.8

所谓金三银四，越早投递，机会越多！

求阿里大文娱暑期实习内推码感谢各位大佬~

第二题代码：public static void main(String[] args) {        Scanner in = new Scanner(System.in);         int n = in.nextInt();        int[] a = new int[n];        int[] b = new int[n];        for(int i=0;i            a[i] = in.nextInt();            b[i] = a[i];}        Arrays.sort(a);long[] sum = new long[n+1];        for(int i=0;i            sum[i+1] = sum[i]+a[i];}        for(int i=0;i            int j =findIndex(a,b[i]);            long left =(long) b[i]*j-sum[j];            long right=sum[n]-sum[j]-(long) b[i]*(n-j);            System.out.println(left+right);}    }    public static int findIndex(int[] nums, int target){        int left=-1,right=nums.length;        while(left+1            int mid = left+(right-left)/2;            if(nums[mid]                left=mid;            } else if (nums[mid]>target) {                right = mid;            }        }        return right;    }

 直接判断！！！！public static boolean brotherWord(String word1, String word2) {        int len1 = word1.length();        int len2 = word2.length();        int[] list1 = new int[len1];        int[] list2 = new int[len2];        for (int i = 0; i             list1[i] = word1.charAt(i);        }        for (int i = 0; i             list2[i] = word2.charAt(i);        } int num1 = Arrays.stream(list1).reduce(1, (int x, int y) -> x * y); int num2 = Arrays.stream(list2).reduce(1, (int x, int y) -> x * y);        if (len1 != len2 || word1.equals(word2)) {            return false;        }        return num1 == num2;    }  我已经通过这道题！ https://www.nowcoder.com/questionTerminal/03ba8aeeef73400ca7a37a5f3370fe68