随笔分类 - LeetCode
摘要：Given two numbers arr1 and arr2 in base -2, return the result of adding them together. Each number is given in array format: as an array of 0s and 1s,
阅读全文
摘要：You are given an binary matrix . You can choose any number of columns in the matrix and flip every cell in that column (i.e., Change the value of the
阅读全文
摘要：For two strings and , we say " divides " if and only if ( concatenated with itself 1 or more times) Given two strings str1 and str2, return the larges
阅读全文
摘要：In a warehouse, there is a row of barcodes, where the barcode is . Rearrange the barcodes so that no two adjacent barcodes are equal. You may return a
阅读全文
摘要：Given an array of positive integers (not necessarily distinct), return the lexicographically largest permutation that is smaller than , that can be ma
阅读全文
摘要：Today, the bookstore owner has a store open for minutes. Every minute, some number of customers ( ) enter the store, and all those customers leave aft
阅读全文
摘要：Given a string s, consider all duplicated substrings: (contiguous) substrings of s that occur 2 or more times. The occurrences may overlap. Return any
阅读全文
摘要：Students are asked to stand in non decreasing order of heights for an annual photo. Return the minimum number of students that must move in order for
阅读全文
摘要：You are given an array of integers stones where stones[i] is the weight of the ith stone. We are playing a game with the stones. On each turn, we choo
阅读全文
摘要：Given a list of words, each word consists of English lowercase letters. Let's say is a predecessor of if and only if we can add exactly one letter any
阅读全文
摘要：Given a string of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them. We repeatedly make du
阅读全文
摘要：We have a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and smash them together. Suppos
阅读全文
摘要：Given an integer array , you should partition the array into (contiguous) subarrays of length at most . After partitioning, each subarray has their va
阅读全文
摘要：You have gardens, labeled from to , and an array where describes a bidirectional path between garden to garden . In each garden, you want to plant one
阅读全文
摘要：On an infinite plane, a robot initially stands at and faces north. The robot can receive one of three instructions: : go straight 1 unit; : turn 90 de
阅读全文
摘要：On an infinite number line, the position of the i th stone is given by . Call a stone an endpoint stone if it has the smallest or largest position. Ea
阅读全文
摘要：You have a convex n-sided polygon where each vertex has an integer value. You are given an integer array values where values[i] is the value of the it
阅读全文
摘要：Given the of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum
阅读全文
摘要：In a 1 million by 1 million grid, the coordinates of each grid square are . We start at the square and want to reach the square. Each move, we can wal
阅读全文
摘要：A boomerang is a set of 3 points that are all distinct and not in a straight line. Given a list of three points in the plane, return whether these poi
阅读全文
