08 2020 档案
摘要:I have run into 2 different problems that can be solved using binary lifting. Then there is second thread's tree basics youtube video that talks about
阅读全文
摘要:Given an array arr that represents a permutation of numbers from 1 to n. You have a binary string of size n that initially has all its bits set to zer
阅读全文
摘要:Given an integer n and an integer array rounds. We have a circular track which consists of n sectors labeled from 1 to n. A marathon will be held on t
阅读全文
摘要:On a broken calculator that has a number showing on its display, we can perform two operations: Double: Multiply the number on the display by 2, or; D
阅读全文
摘要:Your task is to form an integer array nums from an initial array of zeros arr that is the same size as nums. Return the minimum number of function cal
阅读全文
摘要:Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k <= m + n from digits of the two. Th
阅读全文
摘要:In universe Earth C-137, Rick discovered a special form of magnetic force between two balls if they are put in his new invented basket. Rick has n emp
阅读全文
摘要:Start from integer 1, remove any integer that contains 9 such as 9, 19, 29... So now, you will have a new integer sequence: 1, 2, 3, 4, 5, 6, 7, 8, 10
阅读全文
摘要:Given a string s. An awesome substring is a non-empty substring of s such that we can make any number of swaps in order to make it palindrome. Return
阅读全文
摘要:There are G people in a gang, and a list of various crimes they could commit. The i-th crime generates a profit[i] and requires group[i] gang members
阅读全文
摘要:Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n. Example: Input: 13 Output: 6 Exp
阅读全文

浙公网安备 33010602011771号