题目描述 解题思路 假如按i分割,【0···i】为left,【i+1···numsSize-1】为right,maxLeft【i】为按i分割时left中的最大值,minRight【i】为按i分割时right中的最小值。遍历得到所有maxLfet【i】和minRight【i】,找出最小的i使maxLeft【i】<=minRight【i】即可 代码