摘要:
There are three problems in hackrank. two sum http request to get title binary search (find first large/small element)(网上没有一个现成运行的代码) 都是些不是很难的题, 但是因为是 阅读全文
posted @ 2018-08-09 15:56
wz30
阅读(300)
评论(0)
推荐(0)
摘要:
1. Solution: add popmax this func, you can pop out max at any time , so max stack to track the max elements does not work as minstack(leetcode 155) di 阅读全文
posted @ 2018-08-09 13:28
wz30
阅读(405)
评论(0)
推荐(0)

浙公网安备 33010602011771号