摘要：
Find K Pairs with Smallest Sums 查找和最小的K对数字 You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k. Define a pair 阅读全文
摘要：
被包围的区域 Surrounded Regions 有一个 m*n的矩阵，每个坐标都有字符X ,O组成，找到所有被X包围的O区域。 将O换成X in：[["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X 阅读全文
摘要：
Kth Largest Element in a Stream 数据流中的第 K 大元素 Design a class to find the kth largest element in a stream. Note that it is the kth largest element in th 阅读全文