Lisanaaa －小专栏

首页

发现

小书

Lisanaaa

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

关注 0 被关注 108 获得赞 278

个人专栏

结构化算法刷题训练指南

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

已发表 370

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 结构化算法刷题训练指南

972. Equal Rational Numbers

972. Equal Rational Numbers <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/equal-rational-numbers/ 内容描述 Given two strings S and T, each of which represents a non-negative rational number, return Tr...

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

971. Flip Binary Tree To Match Preorder Traversal

971. Flip Binary Tree To Match Preorder Traversal <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/ 内容描述 Given a binary tree with N nodes, each node ...

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

970. Powerful Integers

970. Powerful Integers <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/powerful-integers/ 内容描述 Given two non-negative integers x and y, an integer is powerful if it is equal to x^i + y^j for some ...

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

1079. Letter Tile Possibilities

1079. Letter Tile Possibilities <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/letter-tile-possibilities/ 内容描述 You have a set of tiles, where each tile has one letter tiles[i] printed on it. ...

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

1081. Smallest Subsequence of Distinct Characters

1081. Smallest Subsequence of Distinct Characters <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/ 内容描述 Return the lexicographically smallest subsequ...

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

1080. Insufficient Nodes in Root to Leaf Paths

1080. Insufficient Nodes in Root to Leaf Paths <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/ 内容描述 Given the root of a binary tree, consider all root ...

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

1078. Occurrences After Bigram

1078. Occurrences After Bigram <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/occurrences-after-bigram/ 内容描述 Given words first and second, consider occurrences in some text of the form "first sec...

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

969. Pancake Sorting

969. Pancake Sorting <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/pancake-sorting/ 内容描述 Given an array A, we can perform a pancake flip: We choose some positive integer k <= A.length, the...

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

968. Binary Tree Cameras

968. Binary Tree Cameras <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/binary-tree-cameras/ 内容描述 Given a binary tree, we install cameras on the nodes of the tree. Each camera at a node can monit...

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

967. Numbers With Same Consecutive Differences

967. Numbers With Same Consecutive Differences <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/numbers-with-same-consecutive-differences/ 内容描述 Return all non-negative integers of length N such ...

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

868. Binary Gap

868. Binary Gap <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/binary-gap/ 内容描述 Given a positive integer N, find and return the longest distance between two consecutive 1's in the binary represen...

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

455. Assign Cookies

455. Assign Cookies <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/assign-cookies/ 内容描述 Assume you are an awesome parent and want to give your children some cookies. But, you should give each chi...

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

557. Reverse Words in a String III

557. Reverse Words in a String III <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/reverse-words-in-a-string-iii/ 内容描述 Given a string, you need to reverse the order of characters in each word with...

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

717. 1-bit and 2-bit Characters

717. 1-bit and 2-bit Characters <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/1-bit-and-2-bit-characters/ 内容描述 We have two special characters. The first character can be represented by one bit 0...

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

637. Average of Levels in Binary Tree

637. Average of Levels in Binary Tree <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/average-of-levels-in-binary-tree/ 内容描述 Given a non-empty binary tree, return the average value of the nodes on...

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

520. Detect Capital

520. Detect Capital <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/detect-capital/ 内容描述 Given a word, you need to judge whether the usage of capitals in it is right or not. We define the usage o...

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

447. Number of Boomerangs

447. Number of Boomerangs <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/number-of-boomerangs/ 内容描述 Given n points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points ...

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

188. Best Time to Buy and Sell Stock IV

188. Best Time to Buy and Sell Stock IV <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/ 内容描述 Say you have an array for which the ith element is the p...

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

1071. Greatest Common Divisor of Strings

1071. Greatest Common Divisor of Strings <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/greatest-common-divisor-of-strings/ 内容描述 For strings S and T, we say "T divides S" if and only if S = T + ....

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

1072. Flip Columns For Maximum Number of Equal Rows

1072. Flip Columns For Maximum Number of Equal Rows <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/ 内容描述 Given a matrix consisting of 0s and 1s, w...

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

1073. Adding Two Negabinary Numbers

1073. Adding Two Negabinary Numbers <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/adding-two-negabinary-numbers/ 内容描述 Given two numbers arr1 and arr2 in base -2, return the result of adding t...

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

1074. Number of Submatrices That Sum to Target

1074. Number of Submatrices That Sum to Target <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/ 内容描述 Given a matrix, and a target, return the number of non-e...

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

1064. Fixed Point

1064. Fixed Point <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/fixed-point/ 内容描述 Given an array A of distinct integers sorted in ascending order, return the smallest index i that satisfies A[i]...

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

1065. Index Pairs of a String

1065. Index Pairs of a String <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/index-pairs-of-a-string/ 内容描述 Given a text string and words (a list of strings), return all index pairs [i, j] so that...

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

1066. Campus Bikes II

1066. Campus Bikes II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/campus-bikes-ii/ 内容描述 On a campus represented as a 2D grid, there are N workers and M bikes, with N <= M. Each worker an...

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

1067. Digit Count in Range

1067. Digit Count in Range <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/digit-count-in-range/ 内容描述 Given an integer d between 0 and 9, and two positive integers low and high as lower and upper bo...

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

966. Vowel Spellchecker

966. Vowel Spellchecker <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/vowel-spellchecker/ 内容描述 Given a wordlist, we want to implement a spellchecker that converts a query word into a correct ...

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

965. Univalued Binary Tree

965. Univalued Binary Tree <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/univalued-binary-tree/ 内容描述 A binary tree is univalued if every node in the tree has the same value. Return true if and ...

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

964. Least Operators to Express Number

964. Least Operators to Express Number <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/least-operators-to-express-number/ 内容描述 Given a single positive integer x, we will write an expression of the f...

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

963. Minimum Area Rectangle II

963. Minimum Area Rectangle II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/minimum-area-rectangle-ii/ 内容描述 Given a set of points in the xy-plane, determine the minimum area of any rectangle...

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

1054. Distant Barcodes

1054. Distant Barcodes <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/distant-barcodes/ 内容描述 In a warehouse, there is a row of barcodes, where the i-th barcode is barcodes[i]. Rearrange the b...

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

1053. Previous Permutation With One Swap

1053. Previous Permutation With One Swap <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/previous-permutation-with-one-swap/ 内容描述 Given an array A of positive integers (not necessarily distinct...

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

1052. Grumpy Bookstore Owner

1052. Grumpy Bookstore Owner <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/grumpy-bookstore-owner/ 内容描述 Today, the bookstore owner has a store open for customers.length minutes. Every minute...

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

1051. Height Checker

1051. Height Checker <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/height-checker/ 内容描述 Students are asked to stand in non-decreasing order of heights for an annual photo. Return the minimum nu...

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

962. Maximum Width Ramp

962. Maximum Width Ramp <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/maximum-width-ramp/ 内容描述 Given an array A of integers, a ramp is a tuple (i, j) for which i < j and A[i] <= A[j]. ...

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

469. Convex Polygon

469. Convex Polygon <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/convex-polygon/ 内容描述 Given a list of points that form a polygon when joined sequentially, find if this polygon is convex (Con...

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

397. Integer Replacement

397. Integer Replacement <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/integer-replacement/ 内容描述 Given a positive integer n and you can do operations as follow: If n is even, replace n with ...

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

300. Longest Increasing Subsequence

300. Longest Increasing Subsequence <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/longest-increasing-subsequence/description/ 内容描述 Given an unsorted array of integers, find the length of long...

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

1045. Customers Who Bought All Products

1045. Customers Who Bought All Products <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/customers-who-bought-all-products/ 内容描述 SQL Schema Table: Customer +-------------+---------+ | Column Na...

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

1046. Last Stone Weight

1046. Last Stone Weight <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/last-stone-weight/ 内容描述 We have a collection of rocks, each rock has a positive integer weight. Each turn, we choose the tw...

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

1047. Remove All Adjacent Duplicates In String

1047. Remove All Adjacent Duplicates In String <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/ 内容描述 Given a string S of lowercase letters, a duplicate rem...

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

1048. Longest String Chain

1048. Longest String Chain <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/longest-string-chain/ 内容描述 Given a list of words, each word consists of English lowercase letters. Let's say word1 is...

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

1049. Last Stone Weight II

1049. Last Stone Weight II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/last-stone-weight-ii/ 内容描述 We have a collection of rocks, each rock has a positive integer weight. Each turn, we choo...

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

914. X of a Kind in a Deck of Cards

914. X of a Kind in a Deck of Cards <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/contest/weekly-contest-104/problems/x-of-a-kind-in-a-deck-of-cards/ 内容描述 In a deck of cards, each card has an integer wri...

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

405. Convert a Number to Hexadecimal

405. Convert a Number to Hexadecimal <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/convert-a-number-to-hexadecimal/ 内容描述 Given an integer, write an algorithm to convert it to hexadecimal. For ne...

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

1044. Longest Duplicate Substring

1044. Longest Duplicate Substring <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/longest-duplicate-substring/ 内容描述 Given a string S, consider all duplicated substrings: (contiguous) substrings of S...

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

1043. Partition Array for Maximum Sum

1043. Partition Array for Maximum Sum <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/partition-array-for-maximum-sum/ 内容描述 Given an integer array A, you partition the array into (contiguous) s...

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

1042. Flower Planting With No Adjacent

1042. Flower Planting With No Adjacent <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/flower-planting-with-no-adjacent/ 内容描述 You have N gardens, labelled 1 to N. In each garden, you want to plan...

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

1041. Robot Bounded In Circle

1041. Robot Bounded In Circle <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/robot-bounded-in-circle/ 内容描述 On an infinite plane, a robot initially stands at (0, 0) and faces north. The robot can...

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

949. Largest Time for Given Digits

949. Largest Time for Given Digits <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/largest-time-for-given-digits/ 内容描述 Given an array of 4 digits, return the largest 24 hour time that can be mad...

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

395. Longest Substring with At Least K Repeating Characters

395. Longest Substring with At Least K Repeating Characters <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/ 内容描述 Find the length of the l...

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

290. Word Pattern

290. Word Pattern <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/word-pattern/ 内容描述 Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such t...

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

289. Game of Life

289. Game of Life <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/game-of-life/ 内容描述 According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton ...

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 结构化算法刷题训练指南

286. Walls and Gates

286. Walls and Gates <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/walls-and-gates/ 内容描述 You are given a m x n 2D grid initialized with these three possible values. -1 - A wall or an obstacl...

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

285. Inorder Successor in BST

285. Inorder Successor in BST <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/inorder-successor-in-bst/description/ 内容描述 Given a binary search tree and a node in it, find the in-order successo...

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

283. Move Zeroes

283. Move Zeroes <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/move-zeroes/description/ 内容描述 Given an array nums, write a function to move all 0's to the end of it while maintaining the relative...

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

282. Expression Add Operators

282. Expression Add Operators <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/expression-add-operators/ 内容描述 Given a string that contains only digits 0-9 and a target value, return all possibilities...

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

281. Zigzag Iterator

281. Zigzag Iterator <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/zigzag-iterator/ 内容描述 Given two 1d vectors, implement an iterator to return their elements alternately. Example: Input: v1...

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

324. Wiggle Sort II

324. Wiggle Sort II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/wiggle-sort-ii/ 内容描述 Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3].... E...

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

280. Wiggle Sort

280. Wiggle Sort <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/wiggle-sort/description/ 内容描述 Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] &l...

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

412. Fizz Buzz

412. Fizz Buzz <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/two-sum 内容描述 Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should out...

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

410. Split Array Largest Sum

410. Split Array Largest Sum <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/split-array-largest-sum/ 内容描述 Given an array which consists of non-negative integers and an integer m, you can split the ...

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

998. Maximum Binary Tree II

998. Maximum Binary Tree II <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/maximum-binary-tree-ii/ 内容描述 We are given the root node of a maximum tree: a tree where every node has a value greate...

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

997. Find the Town Judge

997. Find the Town Judge <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/find-the-town-judge/ 内容描述 In a town, there are N people labelled from 1 to N. There is a rumor that one of these people is...

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

996. Number of Squareful Arrays

996. Number of Squareful Arrays <font color=red>难度: Hard</font> 刷题内容原题连接 https://leetcode.com/problems/number-of-squareful-arrays/ 内容描述 Given an array A of non-negative integers, the array is squareful if for every pair o...

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

995. Minimum Number of K Consecutive Bit Flips

995. Minimum Number of K Consecutive Bit Flips <font color=red>难度: hard</font> 刷题内容原题连接 https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/ 内容描述 In an array A containing only 0s and 1s, a K-bit flip c...

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

345. Reverse Vowels of a String

345. Reverse Vowels of a String <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/reverse-vowels-of-a-string/ 内容描述 Write a function that takes a string as input and reverse only the vowels of a st...

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

344. Reverse String

344. Reverse String <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/reverse-string/ 内容描述 Write a function that takes a string as input and returns the string reversed. Example 1: Input: "hello" ...

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

261. Graph Valid Tree

261. Graph Valid Tree <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/graph-valid-tree/ 内容描述 Given n nodes labeled from 0 to n-1 and a list of undirected edges (each edge is a pair of nodes), w...

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

260. Single Number III

260. Single Number III <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/single-number-iii/ 内容描述 Given an array of numbers nums, in which exactly two elements appear only once and all the other e...

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

259. 3Sum Smaller

259. 3Sum Smaller <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/3sum-smaller/ 内容描述 Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0 <= i &lt...

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

258. Add Digits

258. Add Digits <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/add-digits/description/ 内容描述 Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. E...

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

257. Binary Tree Paths

257. Binary Tree Paths <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/binary-tree-paths/description/ 内容描述 Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no child...

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

256. Paint House

256. Paint House <font color=green>难度: Easy</font> 刷题内容原题连接 https://leetcode.com/problems/paint-house/ 内容描述 There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost...

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

255. Verify Preorder Sequence in Binary Search Tree

255. Verify Preorder Sequence in Binary Search Tree <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/ 内容描述 Given an array of numbers, verify whethe...

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

254. Factor Combinations

254. Factor Combinations <font color=orange>难度: Medium</font> 刷题内容原题连接 https://leetcode.com/problems/factor-combinations/description/ 内容描述 Numbers can be regarded as product of its factors. For example, 8 = 2 x 2 x 2; ...

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