有沒(méi)有一種非常Python式的方法來(lái)按內(nèi)部數(shù)組的長(zhǎng)度對(duì)二維數(shù)組進(jìn)行排序？例如轉(zhuǎn)動(dòng)這個(gè)：[][[23, 70, 90]][[23, 70, 90], [48, 56, 99]][[23, 70, 90], [48, 56, 99], [79, 89, 91]][[23, 70, 90], [79, 89, 91]][[48, 56, 99]][[48, 56, 99], [79, 89, 91]][[79, 89, 91]]進(jìn)入：[[23, 70, 90], [48, 56, 99], [79, 89, 91]][[23, 70, 90], [48, 56, 99]][[23, 70, 90], [79, 89, 91]][[48, 56, 99], [79, 89, 91]][[23, 70, 90]][[48, 56, 99]][[79, 89, 91]][]當(dāng)然有一行代碼可以做到這一點(diǎn)嗎？