- 博客(41)
- 收藏
- 关注
RSS订阅原创 HackerRank Largest Rectangle
题目链接 Problem Statement There are N buildings in a certain two-dimensional landscape. Each building has a height given byhi,i∈[1,N]. If you join K adjacent buildings, they will form a
2015-12-18 21:56:20
438
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人