Push your limit!

摘要： Problem Each fence is increased at most 2 times, so dp[i][j] is the min cost to make A[0, i] great with the last fence A[i] increased j times. The ans 阅读全文

摘要： Problem Key idea: 1. for any substring s, if we can do not consider padding prefix 0s, its decimal value is always >= its length. 2. Appending a binar 阅读全文

摘要： Given an array nums, we call (i, j) an important reverse pair if i < j and nums[i] > 2*nums[j]. You need to return the number of important reverse pai 阅读全文

摘要： You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smal 阅读全文

摘要： Given a non-empty string, encode the string such that its encoded length is the shortest. The encoding rule is: k[encoded_string], where the encoded_s 阅读全文

摘要： A Range Module is a module that tracks ranges of numbers. Your task is to design and implement the following interfaces in an efficient manner. addRan 阅读全文

摘要： You are given a 0-indexed integer array nums and an integer k. You are initially standing at index 0. In one move, you can jump at most k steps forwar 阅读全文

摘要： Given a rows * columns matrix mat of ones and zeros, return how many submatrices have all ones. Example 1: Input: mat = [[1,0,1], [1,1,0], [1,1,0]] Ou 阅读全文

摘要： Problem Link: C - Mandarin Orange The problem can be converted to as such: Given an array A of positive integers, find out the the maximum product val 阅读全文

摘要： Given a m * n matrix of ones and zeros, return how many square submatrices have all ones. Example 1: Input: matrix = [ [0,1,1,1], [1,1,1,1], [0,1,1,1] 阅读全文