据传是google的面试题 young tableaus

最新推荐文章于 2024-04-22 09:07:05 发布

lzshlzsh

最新推荐文章于 2024-04-22 09:07:05 发布

阅读量2.2k

点赞数

分类专栏：算法文章标签： google 面试 insert subroutine algorithm search

本文链接：https://blog.csdn.net/lzshlzsh/article/details/5949425

版权

本文探讨了Young tableaux的性质与操作，包括如何在O(m+n)时间内实现EXTRACT-MIN算法、插入新元素以及使用Young tableau进行排序。同时，文章提供了关于判断数是否存在于Young tableau中的高效算法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

今天研究了young tableus，把《算法导论》上该部分的题做了下，感觉还行。

Problems 6-3: Young tableaus

An m × n Young tableau is an m × n matrix such that the entries of each row are in sorted order from left to right and the entries of each column are in sorted order from top to bottom. Some of the entries of a Young tableau may be ∞, which we treat as nonexistent elements. Thus, a Young tableau can be used to hold r ≤ mn finite numbers.

Draw a 4×4 Young tableau containing the elements {9, 16, 3, 2, 4, 8, 5, 14, 12}.
Argue that an m × n Young tableau Y is empty if Y[1, 1] = ∞. Argue that Y is full (contains mn elements) if Y[m, n] < ∞.
Give an algorithm to implement