随笔分类 - Algorithm
摘要：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]
阅读全文
摘要：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
阅读全文
摘要：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
阅读全文
摘要：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
阅读全文
摘要：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
阅读全文
摘要：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
阅读全文
摘要：A split of an integer array is good if: The array is split into three non-empty contiguous subarrays - named left, mid, right respectively from left t
阅读全文
摘要：You are given an integer array nums of even length n and an integer limit. In one move, you can replace any integer from nums with another integer bet
阅读全文
摘要：An undirected graph of n nodes is defined by edgeList, where edgeList[i] = [ui, vi, disi] denotes an edge between nodes ui and vi with distance disi.
阅读全文
摘要：Given an array A of integers, for each integer A[i] we need to choose either x = -K or x = K, and add x to A[i] (only once). After this process, we ha
阅读全文
摘要：We have an array A of non-negative integers. For every (contiguous) subarray B = [A[i], A[i+1], ..., A[j]] (with i <= j), we take the bitwise OR of al
阅读全文
摘要：Given an array of integers A, find the number of triples of indices (i, j, k) such that: 0 <= i < A.length 0 <= j < A.length 0 <= k < A.length A[i] &
阅读全文
浙公网安备 33010602011771号