1class Solution {2 public int maxCoins(int[] piles) {3 Arrays.sort(piles);4 int s = 0, n = piles.length;5 for (int i = n / 3; i < n; i += 2) s += piles[i];6 return s;7 }8}
WPM •0 •0
ACC •0 •0
TIME •0