2025/10/16
思路：先从大到小排序，再从大到小依次插入重建
评价：完全正确！但我没有意识到是贪心法
L[i][j] = L[i-1][j-1] + 1 if s[i] == s[j] min (L[i][j-1], L[i-1][j]) + 1 if not
L = [] *
L =
Queue Reconstruction by Height
思路：先从大到小排序，再从大到小依次插入重建
评价：完全正确！但我没有意识到是贪心法
L[i][j] = L[i-1][j-1] + 1 if s[i] == s[j] min (L[i][j-1], L[i-1][j]) + 1 if not
L = [] *
L =