getChunks() { return chunks; }
描述：找出一个连续子数组，若对该子数组升序排序，则整个数组变为升序。返回符合题意的最短子数组长度。
。业内人士推荐91视频作为进阶阅读
Go release and be
An important note is that the number of times a letter is highlighted from previous guesses does necessarily indicate the number of times that letter appears in the final hurdle.