Lisanaaa －小专栏

首页

发现

小书

Lisanaaa

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

关注 0 被关注 139 获得赞 375

个人专栏

结构化算法刷题训练指南

作者介绍 🀄️： @Lisanaaa：GitHub 万星算法项目作者，18 年获北美，中东和大中华 offer ...

已发表 447

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

1224. Maximum Equal Frequency

1224. Maximum Equal Frequency <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/maximum-equal-frequency/ 内容描述 Given an array nums of positive integers, return the longest possible length of an array p...

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

1223. Dice Roll Simulation

1223. Dice Roll Simulation <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/dice-roll-simulation/ 内容描述 A die simulator generates a random number from 1 to 6 for each roll. You introduced a const...

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

1222. Queens That Can Attack the King

1222. Queens That Can Attack the King <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/queens-that-can-attack-the-king/ 内容描述 On an 8x8 chessboard, there can be multiple Black Queens and one Whit...

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

1221. Split a String in Balanced Strings

1221. Split a String in Balanced Strings <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/split-a-string-in-balanced-strings/ 内容描述 Balanced strings are those who have equal quantity of 'L' and 'R' ...

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

774. Minimize Max Distance to Gas Station

774. Minimize Max Distance to Gas Station <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/minimize-max-distance-to-gas-station/description/ 内容描述 On a horizontal number line, we have gas stations at ...

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

771. Jewels and Stones

771. Jewels and Stones <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/jewels-and-stones/ 内容描述 You're given strings J representing the types of stones that are jewels, and S representing the stone...

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

767. Reorganize String

767. Reorganize String <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/reorganize-string/description/ 内容描述 Given a string S, check if the letters can be rearranged so that two characters that a...

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

1183. Maximum Number of Ones

1183. Maximum Number of Ones <font color=Hard>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/maximum-number-of-ones/ 内容描述 Consider a matrix M with dimensions width * height, such that every cell has value 0 or 1, ...

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

1182. Shortest Distance to Target Color

1182. Shortest Distance to Target Color <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/shortest-distance-to-target-color/ 内容描述 You are given an array colors, in which there are three colors: 1...

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

1181. Before and After Puzzle

1181. Before and After Puzzle <font color=Orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/before-and-after-puzzle/ 内容描述 Given a list of phrases, generate a list of Before and After puzzles. A phrase is a ...

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

1180. Count Substrings with Only One Distinct Letter

1180. Count Substrings with Only One Distinct Letter <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/ 内容描述 Given a string S, return the number of sub...

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

766. Toeplitz Matrix

766. Toeplitz Matrix <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/toeplitz-matrix/description/ 内容描述 A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element. N...

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

765. Couples Holding Hands

765. Couples Holding Hands <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/couples-holding-hands/ 内容描述 N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum...

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

763. Partition Labels

763. Partition Labels <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/partition-labels/description/ 内容描述 A string S of lowercase letters is given. We want to partition this string into as many...

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

754. Reach a Number

754. Reach a Number <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/reach-a-number/ 内容描述 You are standing at position 0 on an infinite number line. There is a goal at position target. On each mov...

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

746. Min Cost Climbing Stairs

746. Min Cost Climbing Stairs <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/min-cost-climbing-stairs/ 内容描述 On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). ...

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

1163. Last Substring in Lexicographical Order

1163. Last Substring in Lexicographical Order <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/last-substring-in-lexicographical-order/ 内容描述 Given a string s, return the last substring of s in lexico...

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

1162. As Far from Land as Possible

1162. As Far from Land as Possible <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/as-far-from-land-as-possible/ 内容描述 Given an N x N grid containing only values 0 and 1, where 0 represents wate...

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

1161. Maximum Level Sum of a Binary Tree

1161. Maximum Level Sum of a Binary Tree <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/ 内容描述 Given the root of a binary tree, the level of its root is 1, th...

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

1160. Find Words That Can Be Formed by Characters

1160. Find Words That Can Be Formed by Characters <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/ 内容描述 You are given an array of strings words and a st...

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

561. Array Partition I

561. Array Partition I <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/array-partition-i/description/ 内容描述 Given an array of 2n integers, your task is to group these integers into n pairs of inte...

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

653. Two Sum IV - Input is a BST

653. Two Sum IV - Input is a BST <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/two-sum-iv-input-is-a-bst/description/ 内容描述 Given a Binary Search Tree and a target number, return true if there ex...

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

575. Distribute Candies

575. Distribute Candies <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/distribute-candies/ 内容描述 Given an integer array with even length, where different numbers in this array represent different ...

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

499. The Maze III

499. The Maze III <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/the-maze-iii/ 内容描述 There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rolling up (u), do...

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

1104. Path In Zigzag Labelled Binary Tree

1104. Path In Zigzag Labelled Binary Tree <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/ 内容描述 In an infinite binary tree where every node has two children,...

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

1103. Distribute Candies to People

1103. Distribute Candies to People <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/distribute-candies-to-people/ 内容描述 We distribute some number of candies, to a row of n = num_people people in the...

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

738. Monotone Increasing Digits

738. Monotone Increasing Digits <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/monotone-increasing-digits/ 内容描述 Given a non-negative integer N, find the largest number that is less than or equ...

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

737. Sentence Similarity II

737. Sentence Similarity II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/sentence-similarity-ii 内容描述 Given two sentences words1, words2 (each represented as an array of strings), and a list ...

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

735. Asteroid Collision

735. Asteroid Collision <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/asteroid-collision/ 内容描述 We are given an array asteroids of integers representing asteroids in a row. For each asteroid,...

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

733. Flood Fill

733. Flood Fill <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/flood-fill/description/ 内容描述 An image is represented by a 2-D array of integers, each integer representing the pixel value of the im...

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

730. Count Different Palindromic Subsequences

730. Count Different Palindromic Subsequences <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/count-different-palindromic-subsequences/ 内容描述 Given a string S, find the number of different non-empty ...

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

1102. Path With Maximum Minimum Value

1102. Path With Maximum Minimum Value <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/path-with-maximum-minimum-value/ 内容描述 Given a matrix of integers A with R rows and C columns, find the maxi...

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

1101. The Earliest Moment When Everyone Become Friends

1101. The Earliest Moment When Everyone Become Friends <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends/ 内容描述 In a social group, there are N peop...

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

1100. Find K-Length Substrings With No Repeated Characters

1100. Find K-Length Substrings With No Repeated Characters <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/ 内容描述 Given a string S, return th...

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

1099. Two Sum Less Than K

1099. Two Sum Less Than K <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/two-sum-less-than-k/ 内容描述 Given an array A of integers and integer K, return the maximum S such that there exists i < j...

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

729. My Calendar I

729. My Calendar I <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/my-calendar-i/ 内容描述 Implement a MyCalendar class to store your events. A new event can be added if adding the event will not c...

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

878. Nth Magical Number

878. Nth Magical Number <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/nth-magical-number/description/ 内容描述 A positive integer is magical if it is divisible by either A or B. Return the N-th magic...

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

347. Top K Frequent Elements

347. Top K Frequent Elements <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/top-k-frequent-elements/description/ 内容描述 Given a non-empty array of integers, return the k most frequent elements. ...

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

728. Self Dividing Numbers

728. Self Dividing Numbers <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/self-dividing-numbers/ 内容描述 A self-dividing number is a number that is divisible by every digit it contains. For example...

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

346. Moving Average from Data Stream

346. Moving Average from Data Stream <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/moving-average-from-data-stream/ 内容描述 Given a stream of integers and a window size, calculate the moving averag...

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

800. Similar RGB Color

800. Similar RGB Color <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/similar-rgb-color/description/ 内容描述 In the following, every capital letter represents some hexadecimal digit from 0 to f. T...

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

1096. Brace Expansion II

1096. Brace Expansion II <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/brace-expansion-ii/ 内容描述 Under a grammar given below, strings can represent a set of lowercase words. Let's use R(expr) to d...

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

1095. Find in Mountain Array

1095. Find in Mountain Array <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/find-in-mountain-array/ 内容描述 (This problem is an interactive problem.) You may recall that an array A is a mountain arra...

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

1094. Car Pooling

1094. Car Pooling <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/car-pooling/ 内容描述 You are driving a vehicle that has capacity empty seats initially available for passengers. The vehicle only...

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

1093. Statistics from a Large Sample

1093. Statistics from a Large Sample <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/statistics-from-a-large-sample/ 内容描述 We sampled integers between 0 and 255, and stored the results in an arr...

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

808. Soup Servings

808. Soup Servings <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/soup-servings/ 内容描述 There are two types of soup: type A and type B. Initially we have N ml of each type of soup. There are fou...

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

829. Consecutive Numbers Sum

829. Consecutive Numbers Sum <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/consecutive-numbers-sum/ 内容描述 Given a positive integer N, how many ways can we write it as a sum of consecutive positive...

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

960. Delete Columns to Make Sorted III

960. Delete Columns to Make Sorted III <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/delete-columns-to-make-sorted-iii/ 内容描述 We are given an array A of N lowercase letter strings, all of the same ...

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

959. Regions Cut By Slashes

959. Regions Cut By Slashes <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/regions-cut-by-slashes/ 内容描述 In a N x N grid composed of 1 x 1 squares, each 1 x 1 square consists of a /, \, or blan...

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

958. Check Completeness of a Binary Tree

958. Check Completeness of a Binary Tree <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/check-completeness-of-a-binary-tree/ 内容描述 Given a binary tree, determine if it is a complete binary tree...

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

957. Prison Cells After N Days

957. Prison Cells After N Days <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/prison-cells-after-n-days/ 内容描述 There are 8 prison cells in a row, and each cell is either occupied or vacant. Ea...

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

956. Tallest Billboard

956. Tallest Billboard <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/tallest-billboard/ 内容描述 You are installing a billboard and want it to have the largest height. The billboard will have two ste...

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

955. Delete Columns to Make Sorted II

955. Delete Columns to Make Sorted II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/delete-columns-to-make-sorted-ii/ 内容描述 We are given an array A of N lowercase letter strings, all of the sa...

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

954. Array of Doubled Pairs

954. Array of Doubled Pairs <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/array-of-doubled-pairs/ 内容描述 Given an array of integers A with even length, return true if and only if it is possible...

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

953. Verifying an Alien Dictionary

953. Verifying an Alien Dictionary <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/verifying-an-alien-dictionary/ 内容描述 In an alien language, surprisingly they also use english lowercase letters, b...

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

952. Largest Component Size by Common Factor

952. Largest Component Size by Common Factor <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/largest-component-size-by-common-factor/ 内容描述 Given a non-empty array of unique positive integers A, cons...

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

951. Flip Equivalent Binary Trees

951. Flip Equivalent Binary Trees <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/flip-equivalent-binary-trees/ 内容描述 For a binary tree T, we can define a flip operation as follows: choose any n...

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

950. Reveal Cards In Increasing Order

950. Reveal Cards In Increasing Order <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/reveal-cards-in-increasing-order/ 内容描述 In a deck of cards, every card has a unique integer. You can order ...

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

994. Rotting Oranges

994. Rotting Oranges <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/rotting-oranges/ 内容描述 In a given grid, each cell can have one of three values: the value 0 representing an empty cell; the val...

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

993. Cousins in Binary Tree

993. Cousins in Binary Tree <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/cousins-in-binary-tree/ 内容描述 In a binary tree, the root node is at depth 0, and children of each depth k node are at dep...

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

992. Subarrays with K Different Integers

992. Subarrays with K Different Integers <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/subarrays-with-k-different-integers/ 内容描述 Given an array A of positive integers, call a (contiguous, not nece...

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

991. Broken Calculator

991. Broken Calculator <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/broken-calculator/ 内容描述 On a broken calculator that has a number showing on its display, we can perform two operations: D...

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

990. Satisfiability of Equality Equations

990. Satisfiability of Equality Equations <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/satisfiability-of-equality-equations/ 内容描述 Given an array equations of strings that represent relations...

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

989. Add to Array-Form of Integer

989. Add to Array-Form of Integer <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/add-to-array-form-of-integer/ 内容描述 For a non-negative integer X, the array-form of X is an array of its digits in ...

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

988. Smallest String Starting From Leaf

988. Smallest String Starting From Leaf <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/smallest-string-starting-from-leaf/ 内容描述 Given the root of a binary tree, each node has a value from 0 to...

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

987. Vertical Order Traversal of a Binary Tree

987. Vertical Order Traversal of a Binary Tree <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/ 内容描述 Given a binary tree, return the vertical order tra...

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

986. Interval List Intersections

986. Interval List Intersections <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/interval-list-intersections/ 内容描述 Given two lists of closed intervals, each list of intervals is pairwise disjoi...

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

985. Sum of Even Numbers After Queries

985. Sum of Even Numbers After Queries <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/sum-of-even-numbers-after-queries/ 内容描述 We have an array A of integers, and an array queries of queries. For...

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

984. String Without AAA or BBB

984. String Without AAA or BBB <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/string-without-aaa-or-bbb/ 内容描述 Given two integers A and B, return any string S such that: S has length A + B and co...

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

983. Minimum Cost For Tickets

983. Minimum Cost For Tickets <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/minimum-cost-for-tickets/ 内容描述 In a country popular for train travel, you have planned some train travelling one ye...

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

982. Triples with Bitwise AND Equal To Zero

982. Triples with Bitwise AND Equal To Zero <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero/ 内容描述 Given an array of integers A, find the number of triples of i...

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

981. Time Based Key-Value Store

981. Time Based Key-Value Store <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/time-based-key-value-store/ 内容描述 Create a timebased key-value store class TimeMap, that supports two operations. ...

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

980. Unique Paths III

980. Unique Paths III <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/unique-paths-iii/ 内容描述 On a 2-dimensional grid, there are 4 types of squares: 1 represents the starting square. There is exact...

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

979. Distribute Coins in Binary Tree

979. Distribute Coins in Binary Tree <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/distribute-coins-in-binary-tree/ 内容描述 Given the root of a binary tree with N nodes, each node in the tree ha...

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

978. Longest Turbulent Subarray

978. Longest Turbulent Subarray <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/longest-turbulent-subarray/ 内容描述 A subarray A[i], A[i+1], ..., A[j] of A is said to be turbulent if and only if: ...

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

977. Squares of a Sorted Array

977. Squares of a Sorted Array <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/squares-of-a-sorted-array/ 内容描述 Given an array of integers A sorted in non-decreasing order, return an array of the s...

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

976. Largest Perimeter Triangle

976. Largest Perimeter Triangle <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/two-sum 内容描述 Given an array A of positive lengths, return the largest perimeter of a triangle with non-zero area, fo...

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

1088. Confusing Number II

1088. Confusing Number II <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/confusing-number-ii/ 内容描述 We can rotate digits by 180 degrees to form new digits. When 0, 1, 6, 8, 9 are rotated 180 degrees...

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

1087. Permutation of Letters

1087. Permutation of Letters <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/permutation-of-letters/ 内容描述 A string S represents a list of words. Each letter in the word has 1 or more options. ...

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

1086. High Five

1086. High Five <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/high-five/ 内容描述 Given a list of scores of different students, return the average score of each student's top five scores in the orde...

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

1085. Sum of Digits in the Minimum Number

1085. Sum of Digits in the Minimum Number <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/ 内容描述 Given an array A of positive integers, let S be the sum of the d...

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

975. Odd Even Jump

975. Odd Even Jump <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/odd-even-jump/ 内容描述 You are given an integer array A. From some starting index, you can make a series of jumps. The (1st, 3rd, 5t...

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

974. Subarray Sums Divisible by K

974. Subarray Sums Divisible by K <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/subarray-sums-divisible-by-k/ 内容描述 Given an array A of integers, return the number of (contiguous, non-empty) s...

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

973. K Closest Points to Origin

973. K Closest Points to Origin <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/k-closest-points-to-origin/ 内容描述 We have a list of points on the plane. Find the K closest points to the origin (0,...

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

599. Minimum Index Sum of Two Lists

599. Minimum Index Sum of Two Lists <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/minimum-index-sum-of-two-lists/ 内容描述 Suppose Andy and Doris want to choose a restaurant for dinner, and they bot...

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