Lisanaaa －小专栏

首页

发现

小书

Lisanaaa

作者介绍：开源项目1w+star，秋招拿到国内数个ssp+offer，世界地区共拿10+offer

关注 0 被关注 74 获得赞 155

个人专栏

结构化算法刷题训练指南

作者介绍 🀄️： @Lisanaaa，开源项目 1w+ star，秋招拿到国内数个 ssp offer，世界地区...

已发表 250

Lisanaaa in 结构化算法刷题训练指南

223. Rectangle Area

223. Rectangle Area <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/rectangle-area/description/ 内容描述 Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is ...

Lisanaaa in 结构化算法刷题训练指南

222. Count Complete Tree Nodes

222. Count Complete Tree Nodes <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/count-complete-tree-nodes/ 内容描述 Given a complete binary tree, count the number of nodes. Note: Definition of a c...

Lisanaaa in 结构化算法刷题训练指南

1032. Stream of Characters

1032. Stream of Characters <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/stream-of-characters/ 内容描述 Implement the StreamChecker class as follows: StreamChecker(words): Constructor, init the data ...

Lisanaaa in 结构化算法刷题训练指南

1031. Maximum Sum of Two Non-Overlapping Subarrays

1031. Maximum Sum of Two Non-Overlapping Subarrays <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays/ 内容描述 Given an array A of non-negative integers, ...

Lisanaaa in 结构化算法刷题训练指南

1029. Two City Scheduling

1029. Two City Scheduling <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/two-city-scheduling/ 内容描述 There are 2N people a company is planning to interview. The cost of flying the i-th person to ci...

Lisanaaa in 结构化算法刷题训练指南

1030. Matrix Cells in Distance Order

1030. Matrix Cells in Distance Order <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/matrix-cells-in-distance-order/ 内容描述 We are given a matrix with R rows and C columns has cells with integer coo...

Lisanaaa in 结构化算法刷题训练指南

221. Maximal Square

221. Maximal Square <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/maximal-square/description/ 内容描述 Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1'...

Lisanaaa in 结构化算法刷题训练指南

220. Contains Duplicate III

220. Contains Duplicate III <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/contains-duplicate-iii/ 内容描述 Given an array of integers, find out whether there are two distinct indices i and j in t...

Lisanaaa in 结构化算法刷题训练指南

219. Contains Duplicate II

219. Contains Duplicate II <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/contains-duplicate-ii/ 内容描述 Given an array of integers and an integer k, find out whether there are two distinct indices ...

Lisanaaa in 结构化算法刷题训练指南

218. The Skyline Problem

218. The Skyline Problem <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/the-skyline-problem/description/ 内容描述 A city's skyline is the outer contour of the silhouette formed by all the buildings in ...

Lisanaaa in 结构化算法刷题训练指南

217. Contains Duplicate

217. Contains Duplicate <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/contains-duplicate/ 内容描述 Given an array of integers, find if the array contains any duplicates. Your function should retur...

Lisanaaa in 结构化算法刷题训练指南

2019 力扣杯-全国高校春季编程大赛初赛-4. 从始点到终点的所有路径

4. 从始点到终点的所有路径 <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode-cn.com/contest/college/2019-spring/problems/all-paths-from-source-lead-to-destination/ 内容描述给定有向图的边 edges，以...

Lisanaaa in 结构化算法刷题训练指南

2019 力扣杯-全国高校春季编程大赛初赛-3. 最小化舍入误差以满足目标

3. 最小化舍入误差以满足目标 <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode-cn.com/contest/college/2019-spring/problems/minimize-rounding-error-to-meet-target/ 内容描述给定一系列价格 [p1,p2....

Lisanaaa in 结构化算法刷题训练指南

2019 力扣杯-全国高校春季编程大赛初赛-2. 校园自行车分配

2. 校园自行车分配 <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode-cn.com/contest/college/2019-spring/problems/campus-bikes/ 内容描述在由 2D 网格表示的校园里有 n 位工人（worker）和 m 辆...

Lisanaaa in 结构化算法刷题训练指南

2019 力扣杯-全国高校春季编程大赛初赛-1.易混淆数

1. 易混淆数 <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode-cn.com/contest/college/2019-spring/problems/confusing-number/ 内容描述给定一个数字 N，当它满足以下条件的时候返回 true：把原...

Lisanaaa in 结构化算法刷题训练指南

1025. Divisor Game

1025. Divisor Game <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/divisor-game/ 内容描述 Alice and Bob take turns playing a game, with Alice starting first. Initially, there is a number N on the cha...

Lisanaaa in 结构化算法刷题训练指南

1026. Maximum Difference Between Node and Ancestor

1026. Maximum Difference Between Node and Ancestor <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/ 内容描述 Given the root of a binary tree, find the m...

Lisanaaa in 结构化算法刷题训练指南

1028. Recover a Tree From Preorder Traversal

1028. Recover a Tree From Preorder Traversal <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/ 内容描述 We run a preorder depth first search on the root of a binary...

Lisanaaa in 结构化算法刷题训练指南

1027. Longest Arithmetic Sequence

1027. Longest Arithmetic Sequence <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/longest-arithmetic-sequence/ 内容描述 Given an array A of integers, return the length of the longest arithmetic sub...

Lisanaaa in 结构化算法刷题训练指南

216. Combination Sum III

216. Combination Sum III <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/combination-sum-iii/description/ 内容描述 Find all possible combinations of k numbers that add up to a number n, given that...

Lisanaaa in 结构化算法刷题训练指南

215. Kth Largest Element in an Array

215. Kth Largest Element in an Array <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/kth-largest-element-in-an-array/description/ 内容描述 Find the kth largest element in an unsorted array. Note th...

Lisanaaa in 结构化算法刷题训练指南

454. 4Sum II

454. 4Sum II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/4sum-ii 内容描述 Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C...

Lisanaaa in 结构化算法刷题训练指南

961. N-Repeated Element in Size 2N Array

961. N-Repeated Element in Size 2N Array <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/n-repeated-element-in-size-2n-array/ 内容描述 In a array A of size 2N, there are N+1 unique elements, and exact...

Lisanaaa in 结构化算法刷题训练指南

214. Shortest Palindrome

214. Shortest Palindrome <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/shortest-palindrome/ 内容描述 Given a string s, you are allowed to convert it to a palindrome by adding characters in front of it...

Lisanaaa in 结构化算法刷题训练指南

213. House Robber II

213. House Robber II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/house-robber-ii 内容描述 You are a professional robber planning to rob houses along a street. Each house has a certain amount of...

Lisanaaa in 结构化算法刷题训练指南

212. Word Search II

212. Word Search II <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/word-search-ii/ 内容描述 Given a 2D board and a list of words from the dictionary, find all words in the board. Each word must be con...

Lisanaaa in 结构化算法刷题训练指南

211. Add and Search Word - Data structure design

211. Add and Search Word - Data structure design <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/add-and-search-word-data-structure-design/ 内容描述 Design a data structure that supports the follow...

Lisanaaa in 结构化算法刷题训练指南

210. Course Schedule II

210. Course Schedule II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/course-schedule-ii/description/ 内容描述 There are a total of n courses you have to take, labeled from 0 to n-1. Some course...

Lisanaaa in 结构化算法刷题训练指南

209. Minimum Size Subarray Sum

209. Minimum Size Subarray Sum <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/minimum-size-subarray-sum/description/ 内容描述 Given an array of n positive integers and a positive integer s, find t...

Lisanaaa in 结构化算法刷题训练指南

208. Implement Trie (Prefix Tree)

208. Implement Trie (Prefix Tree) <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/implement-trie-prefix-tree/ 内容描述 Implement a trie with insert, search, and startsWith methods. Example: Trie...

Lisanaaa in 结构化算法刷题训练指南

207. Course Schedule

207. Course Schedule <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/course-schedule/description/ 内容描述 There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may ...

Lisanaaa in 结构化算法刷题训练指南

206. Reverse Linked List

206. Reverse Linked List <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/reverse-linked-list/description/ 内容描述 Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL Ou...

Lisanaaa in 结构化算法刷题训练指南

205. Isomorphic Strings

205. Isomorphic Strings <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/isomorphic-strings/ 内容描述 Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the cha...

Lisanaaa in 结构化算法刷题训练指南

204. Count Primes

204. Count Primes <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/count-primes/ 内容描述 Count the number of prime numbers less than a non-negative number, n. Example: Input: 10 Output: 4 Explanatio...

Lisanaaa in 结构化算法刷题训练指南

203. Remove Linked List Elements

203. Remove Linked List Elements <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/remove-linked-list-elements/ 内容描述 Remove all elements from a linked list of integers that have value val. Example:...

Lisanaaa in 结构化算法刷题训练指南

202. Happy Number

202. Happy Number <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/happy-number/ 内容描述 Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following pr...

Lisanaaa in 结构化算法刷题训练指南

913. Cat and Mouse

913. Cat and Mouse <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/cat-and-mouse/description/ 内容描述 A game on an undirected graph is played by two players, Mouse and Cat, who alternate turns. The gr...

Lisanaaa in 结构化算法刷题训练指南

910. Smallest Range II

910. Smallest Range II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/smallest-range-ii/description/ 内容描述 Given an array A of integers, for each integer A[i] we need to choose either x = -K or...

Lisanaaa in 结构化算法刷题训练指南

908. Smallest Range

908. Smallest Range <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/smallest-range-i/description/ 内容描述 Given an array A of integers, for each integer A[i] we may choose any x with -K <= x <=...

Lisanaaa in 结构化算法刷题训练指南

907. Sum of Subarray Minimums

907. Sum of Subarray Minimums <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/sum-of-subarray-minimums/description/ 内容描述 Given an array of integers A, find the sum of min(B), where B ranges ov...

Lisanaaa in 结构化算法刷题训练指南

906. Super Palindromes

906. Super Palindromes <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/super-palindromes/ 内容描述 Let's say a positive integer is a superpalindrome if it is a palindrome, and it is also the square of a...

Lisanaaa in 结构化算法刷题训练指南

905. Sort Array By Parity

905. Sort Array By Parity <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/sort-array-by-parity/description/ 内容描述 Given an array A of non-negative integers, return an array consisting of all the ev...

Lisanaaa in 结构化算法刷题训练指南

904. Fruit Into Baskets

904. Fruit Into Baskets <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/contest/weekly-contest-102/problems/fruit-into-baskets/ 内容描述 In a row of trees, the i-th tree produces fruit with type tree[i]. Y...

Lisanaaa in 结构化算法刷题训练指南

902. Numbers At Most N Given Digit Set

902. Numbers At Most N Given Digit Set <font color=red>难度: hard</font> 刷题内容原题连接 https://leetcode.com/problems/numbers-at-most-n-given-digit-set/description/ 内容描述 We have a sorted set of digits D, a non-empty subset of {'1...

Lisanaaa in 结构化算法刷题训练指南

1024. Video Stitching

1024. Video Stitching <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/video-stitching/ 内容描述 You are given a series of video clips from a sporting event that lasted T seconds. These video clips...

Lisanaaa in 结构化算法刷题训练指南

1023. Camelcase Matching

1023. Camelcase Matching <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/camelcase-matching/ 内容描述 A query word matches a given pattern if we can insert lowercase letters to the pattern word so ...

Lisanaaa in 结构化算法刷题训练指南

1022. Sum of Root To Leaf Binary Numbers

1022. Sum of Root To Leaf Binary Numbers <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/ 内容描述 Given a binary tree, each node has value 0 or 1. Each root-to-lea...

Lisanaaa in 结构化算法刷题训练指南

1021. Remove Outermost Parentheses

1021. Remove Outermost Parentheses <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/remove-outermost-parentheses/ 内容描述 A valid parentheses string is either empty (""), "(" + A + ")", or A + B, wher...

Lisanaaa in 结构化算法刷题训练指南

572. Subtree of Another Tree

572. Subtree of Another Tree <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/subtree-of-another-tree/ 内容描述 Given two non-empty binary trees s and t, check whether tree t has exactly the same struc...

Lisanaaa in 结构化算法刷题训练指南

343. Integer Break

343. Integer Break <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/integer-break/ 内容描述 Given a positive integer n, break it into the sum of at least two positive integers and maximize the produ...

Lisanaaa in 结构化算法刷题训练指南

297. Serialize and Deserialize Binary Tree

297. Serialize and Deserialize Binary Tree <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/serialize-and-deserialize-binary-tree/ 内容描述 Serialization is the process of converting a data structure or ...

Lisanaaa in 结构化算法刷题训练指南

328. Odd Even Linked List

328. Odd Even Linked List <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/odd-even-linked-list/ 内容描述 Given a singly linked list, group all odd nodes together followed by the even nodes. Please ...

Lisanaaa in 结构化算法刷题训练指南

452. Minimum Number of Arrows to Burst Balloons

452. Minimum Number of Arrows to Burst Balloons <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/ 内容描述 There are a number of spherical balloons spread ...

Lisanaaa in 结构化算法刷题训练指南

287. Find the Duplicate Number

287. Find the Duplicate Number <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/find-the-duplicate-number/description/ 内容描述 Given an array nums containing n + 1 integers where each integer is b...

Lisanaaa in 结构化算法刷题训练指南

475. Heaters

475. Heaters <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/heaters/ 内容描述 Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the...

Lisanaaa in 结构化算法刷题训练指南

402. Remove K Digits

402. Remove K Digits <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/remove-k-digits/description/ 内容描述 Given a non-negative integer num represented as a string, remove k digits from the number ...

Lisanaaa in 结构化算法刷题训练指南

819. Most Common Word

819. Most Common Word <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/most-common-word/description/ 内容描述 Given a paragraph and a list of banned words, return the most frequent word that is not in ...

Lisanaaa in 结构化算法刷题训练指南

901. Online Stock Span

901. Online Stock Span <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/online-stock-span/description/ 内容描述 Write a class StockSpanner which collects daily price quotes for some stock, and retur...

Lisanaaa in 结构化算法刷题训练指南

801. Minimum Swaps To Make Sequences Increasing

801. Minimum Swaps To Make Sequences Increasing <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing/description/ 内容描述 We have two integer sequences A and...

Lisanaaa in 结构化算法刷题训练指南

701. Insert into a Binary Search Tree

701. Insert into a Binary Search Tree <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/longest-valid-parentheses 内容描述 Given the root node of a binary search tree (BST) and a value to be inserted into...

Lisanaaa in 结构化算法刷题训练指南

698. Partition to K Equal Sum Subsets

698. Partition to K Equal Sum Subsets <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/partition-to-k-equal-sum-subsets/description/ 内容描述 Given an array of integers nums and a positive integer k...

Lisanaaa in 结构化算法刷题训练指南

501. Find Mode in Binary Search Tree

501. Find Mode in Binary Search Tree <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/find-mode-in-binary-search-tree/description/ 内容描述 Given a binary search tree (BST) with duplicates, find all th...

Lisanaaa in 结构化算法刷题训练指南

401. Binary Watch

401. Binary Watch <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/binary-watch/ 内容描述 A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent t...

Lisanaaa in 结构化算法刷题训练指南

301. Remove Invalid Parentheses

301. Remove Invalid Parentheses <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/remove-invalid-parentheses/ 内容描述 Remove the minimum number of invalid parentheses in order to make the input string va...

Lisanaaa in 结构化算法刷题训练指南

201. Bitwise AND of Numbers Range

201. Bitwise AND of Numbers Range <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/bitwise-and-of-numbers-range/description/ 内容描述 Given a range [m, n] where 0 <= m <= n <= 2147483647, r...

Lisanaaa in 结构化算法刷题训练指南

1012. Numbers With 1 Repeated Digit

1012. Numbers With 1 Repeated Digit <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/numbers-with-1-repeated-digit/ 内容描述 Given a positive integer N, return the number of positive integers less than o...

Lisanaaa in 结构化算法刷题训练指南

1011. Capacity To Ship Packages Within D Days

1011. Capacity To Ship Packages Within D Days <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/ 内容描述 A conveyor belt has packages that must be shipped fro...

Lisanaaa in 结构化算法刷题训练指南

1010. Pairs of Songs With Total Durations Divisible by 60

1010. Pairs of Songs With Total Durations Divisible by 60 <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/ 内容描述 In a list of songs, the i-th son...

Lisanaaa in 结构化算法刷题训练指南

1009. Complement of Base 10 Integer

1009. Complement of Base 10 Integer <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/complement-of-base-10-integer/ 内容描述 Every non-negative integer N has a binary representation. For example, 5 ca...

Lisanaaa in 结构化算法刷题训练指南

1008. Construct Binary Search Tree from Preorder Traversal

1008. Construct Binary Search Tree from Preorder Traversal <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/ 内容描述 Return the root node of a b...

Lisanaaa in 结构化算法刷题训练指南

1007. Minimum Domino Rotations For Equal Row

1007. Minimum Domino Rotations For Equal Row <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/ 内容描述 In a row of dominoes, A[i] and B[i] represent the top a...

Lisanaaa in 结构化算法刷题训练指南

1006. Clumsy Factorial

1006. Clumsy Factorial <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/clumsy-factorial/ 内容描述 Normally, the factorial of a positive integer n is the product of all positive integers less than o...

Lisanaaa in 结构化算法刷题训练指南

1005. Maximize Sum Of Array After K Negations

1005. Maximize Sum Of Array After K Negations <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/ 内容描述 Given an array A of integers, we must modify the array i...

Lisanaaa in 结构化算法刷题训练指南

999. Available Captures for Rook

999. Available Captures for Rook <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/available-captures-for-rook/ 内容描述 On an 8 x 8 chessboard, there is one white rook. There also may be empty squares...

Lisanaaa in 结构化算法刷题训练指南

1001. Grid Illumination

1001. Grid Illumination <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/grid-illumination/ 内容描述 On a N x N grid of cells, each cell (x, y) with 0 <= x < N and 0 <= y < N has a lamp. Ini...

Lisanaaa in 结构化算法刷题训练指南

1020. Number of Enclaves

1020. Number of Enclaves <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/number-of-enclaves/ 内容描述 Given a 2D array A, each cell is 0 (representing sea) or 1 (representing land) A move consists...

Lisanaaa in 结构化算法刷题训练指南

1019. Next Greater Node In Linked List

1019. Next Greater Node In Linked List <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/next-greater-node-in-linked-list/ 内容描述 We are given a linked list with head as the first node. Let's numb...

Lisanaaa in 结构化算法刷题训练指南

503. Next Greater Element II

503. Next Greater Element II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/next-greater-element-ii/ 内容描述 Given a circular array (the next element of the last element is the first element of t...

Lisanaaa in 结构化算法刷题训练指南

1018. Binary Prefix Divisible By 5

1018. Binary Prefix Divisible By 5 <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/binary-prefix-divisible-by-5/ 内容描述 Given an array A of 0s and 1s, consider N_i: the i-th subarray from A[0] to A[...

Lisanaaa in 结构化算法刷题训练指南

1017. Convert to Base -2

1017. Convert to Base -2 <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/convert-to-base-2/ 内容描述 Given a number N, return a string consisting of "0"s and "1"s that represents its value in base ...

Lisanaaa in 结构化算法刷题训练指南

504. Base 7

504. Base 7 <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/base-7/ 内容描述 Given an integer, return its base 7 string representation. Example 1: Input: 100 Output: "202" Example 2: Input: -7 Output...

Lisanaaa in 结构化算法刷题训练指南

163. Missing Ranges

163. Missing Ranges <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/missing-ranges/ 内容描述 Given a sorted integer array nums, where the range of elements are in the inclusive range [lower, upper]...

Lisanaaa in 结构化算法刷题训练指南

162. Find Peak Element

162. Find Peak Element <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/find-peak-element/ 内容描述 A peak element is an element that is greater than its neighbors. Given an input array nums, where...

Lisanaaa in 结构化算法刷题训练指南

161. One Edit Distance

161. One Edit Distance <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/one-edit-distance/ 内容描述 Given two strings s and t, determine if they are both one edit distance apart. Note: There are ...

Lisanaaa in 结构化算法刷题训练指南

160. Intersection of Two Linked Lists

160. Intersection of Two Linked Lists <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/intersection-of-two-linked-lists/ 内容描述 Write a program to find the node at which the intersection of two singl...

Lisanaaa in 结构化算法刷题训练指南