02 2021 档案

[LeetCode 493] Reverse Pairs
摘要：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 阅读全文
posted @ 2021-02-18 08:35 Review->Improve 阅读(206) 评论(0) 推荐(0)
[LeetCode 315] Count of Smaller Numbers After Self
摘要：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 阅读全文
posted @ 2021-02-18 02:41 Review->Improve 阅读(657) 评论(0) 推荐(0)
[LeetCode 471] Encode String with Shortest Length
摘要：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 阅读全文
posted @ 2021-02-17 06:06 Review->Improve 阅读(800) 评论(0) 推荐(0)
[LeetCode 715] Range Module
摘要：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 阅读全文
posted @ 2021-02-17 01:45 Review->Improve 阅读(250) 评论(0) 推荐(0)
[LeetCode 1696] Jump Game VI
摘要：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 阅读全文
posted @ 2021-02-16 12:05 Review->Improve 阅读(610) 评论(0) 推荐(0)
[LeetCode 1504] Count Submatrices With All Ones
摘要：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 阅读全文
posted @ 2021-02-16 06:13 Review->Improve 阅读(865) 评论(0) 推荐(0)
[AtCoder] Mandarin Orange
摘要：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 阅读全文
posted @ 2021-02-16 01:08 Review->Improve 阅读(122) 评论(0) 推荐(0)
[LeetCode 1277] Count Square Submatrices with All Ones
摘要：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] 阅读全文
posted @ 2021-02-12 12:01 Review->Improve 阅读(271) 评论(0) 推荐(0)
[LeetCode 149] Max Points on a Line
摘要：Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. Example 1: Input: [[1,1],[2,2],[3,3]] Output: 3 Ex 阅读全文
posted @ 2021-02-07 09:25 Review->Improve 阅读(68) 评论(0) 推荐(0)
[LeetCode 354] Russian Doll Envelopes
摘要：You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and only if both the w 阅读全文
posted @ 2021-02-06 03:42 Review->Improve 阅读(153) 评论(0) 推荐(0)
[LeetCode 1713] Minimum Operations to Make a Subsequence
摘要：You are given an array target that consists of distinct integers and another integer array arr that can have duplicates. In one operation, you can ins 阅读全文
posted @ 2021-02-06 03:18 Review->Improve 阅读(227) 评论(0) 推荐(0)
[BinarySearch] Maximum Product Path in 2D Matrix
摘要：You are given a two-dimensional list of integers matrix. You are currently at the top left corner and want to move to the bottom right corner. In each 阅读全文
posted @ 2021-02-04 07:36 Review->Improve 阅读(98) 评论(0) 推荐(0)
[BinarySearch] Longest Equivalent Subarray After at most K Increments
摘要：You are given a list of integers nums and an integer k. Consider an operation where you increment any one element once(increase by 1). Given that you 阅读全文
posted @ 2021-02-03 11:58 Review->Improve 阅读(375) 评论(0) 推荐(0)