April 21, 2016
Try to work on this algorithm, including problem statement, algorithm involved, and then, get similar question on HackerRank, and do some practice.
矩阵路径最小值的最大值:
给一个int[][]的matirx，对于一条从左上到右下的path p_i，p_i中的最小值是m_i，求所有m_i中的最大值。只能往下或右
No comments:
Post a Comment