2019年9月20日
摘要: 问题描述: Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct el 阅读全文
posted @ 2019-09-20 14:36 狂奔的蜗牛163 阅读(293) 评论(0) 推荐(0) 编辑
摘要: 问题描述: Give a string s, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's 阅读全文
posted @ 2019-09-20 10:26 狂奔的蜗牛163 阅读(281) 评论(0) 推荐(0) 编辑