二分的前提:有序(一提到有序,必须立马想到二分!) int[] array = {1, 2, 3, 3, 3, 5} k=3 => lowerIndex=2 upperIndex=5 int[] array = {1, 2, 4, 5} k=3 => lowerIndex=2 upperIndex=2 public class Solution { private int upper_bound(int[] array, int val) { int l = 0, r = array.length - 1, mid; while (l &l...