haoweizh

摘要： Problem: Given a string S, count the number of distinct, non-empty subsequences of S . Since the result may be large, return the answer modulo 10^9 + 阅读全文

摘要： Problem: Given strings S and T, find the minimum (contiguous) substring W of S, so that T is a subsequence of W. If there is no such window in S that 阅读全文

摘要： Problem: We have a list of bus routes. Each routes[i] is a bus route that the i-th bus repeats forever. For example if routes[0] = [1, 5, 7], this mea 阅读全文

摘要： Problem: LeetCode wants to give one of its best employees the option to travel among N cities to collect algorithm problems. But all work and no play 阅读全文

摘要： Problem: Given an m x n matrix of positive integers representing the height of each unit cell in a 2D elevation map, compute the volume of water it is 阅读全文

摘要： Problem: A group of friends went on holiday and sometimes lent each other money. For example, Alice paid for Bill's lunch for $10. Then later Chris ga 阅读全文

摘要： Problem: Nearly every one have used the Multiplication Table. But could you find out the k-th smallest number quickly from the multiplication table? G 阅读全文

摘要： Problem: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after 阅读全文

摘要： Problem: Your music player contains N different songs and she wants to listen to L(not necessarily different) songs during your trip. You create a pla 阅读全文

摘要： Problem: In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum. Each subarray will be of size k, and we wa 阅读全文