摘要:
You are given a large sample of integers in the range [0, 255]. Since the sample is so large, it is represented by an array count where count[k] is th 阅读全文
摘要:
Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If multiple answers exist, you may return any 阅读全文
摘要:
Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path in a 阅读全文
摘要:
We have a set of items: the i-th item has value values[i] and label labels[i]. Then, we choose a subset S of these items, such that: |S| <= num_wanted 阅读全文
摘要:
Given a fixed length array arr of integers, duplicate each occurrence of zero, shifting the remaining elements to the right. Note that elements beyond 阅读全文
摘要:
We can rotate digits by 180 degrees to form new digits. When 0, 1, 6, 8, 9 are rotated 180 degrees, they become 0, 1, 9, 8, 6 respectively. When 2, 3, 阅读全文
摘要:
On a campus represented as a 2D grid, there are N workers and M bikes, with N <= M. Each worker and bike is a 2D coordinate on this grid. Our goal is 阅读全文
摘要:
Given a number N, return true if and only if it is a confusing number, which satisfies the following condition: We can rotate digits by 180 degrees to 阅读全文
摘要:
From any string, we can form a subsequence of that string by deleting some number of characters (possibly no deletions). Given two strings source and 阅读全文
摘要:
Return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once. Note: This question is the same as 阅读全文
摘要:
Given the root of a binary tree, consider all root to leaf paths: paths from the root to any leaf. (A leaf is a node with no children.) A node is insu 阅读全文
摘要:
You have n tiles, where each tile has one letter tiles[i] printed on it. Return the number of possible non-empty sequences of letters you can make usi 阅读全文
摘要:
Given words first and second, consider occurrences in some text of the form "first second third", where second comes immediately after first, and thir 阅读全文
摘要:
Given a matrix and a target, return the number of non-empty submatrices that sum to target. A submatrix x1, y1, x2, y2 is the set of all cells matrix[ 阅读全文
摘要:
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 阅读全文
摘要:
We write the integers of and (in the order they are given) on two separate horizontal lines. Now, we may draw connecting lines : a straight line conne 阅读全文
摘要:
Given a 2 dimensional of integers, each value in the grid represents the color of the grid square at that location. Two squares belong to the same con 阅读全文
摘要:
Three stones are on a number line at positions , , and . Each turn, you pick up a stone at an endpoint (ie., either the lowest or highest position sto 阅读全文
摘要:
Implement the class as follows: : Constructor, init the data structure with the given words. : returns true if and only if for some , the last charact 阅读全文
摘要:
Given an array of non negative integers, return the maximum sum of elements in two non overlapping (contiguous) subarrays, which have lengths and . (F 阅读全文
摘要:
We are given a matrix with rows and columns has cells with integer coordinates , where `0 这道题给了一个R行C列的矩阵,又给了一个起始点 (r0, c0),让按照离起始点的曼哈顿距离从小到大排序坐标点。博主最先 阅读全文