Greedy algorithm: maximum number
Offer to come, dig friends take it! I am participating in the 2022 Spring Recruit series activities - click on the task to see the details of the activities. The greedy algorithm sorts the array to find the maximum value of the combination
2100. A good day to rob a bank
Offer to come, dig friends take it! I am participating in the 2022 Spring Recruit Punch card activity. Click here for details. 【 典 型 范 例 2 】 A day suitable for robbing a bank. A good day to rob a bank. Medium
258. Add them all up
Offer to come, dig friends take it! I am participating in the 2022 Spring Recruit series activities - click on the task to see the details of the activities. Given a non-negative integer num, add the digits repeatedly until the result is a single digit. Returns the result. Thought analysis
Greedy algorithm: detonate the balloon with the minimum number of arrows ?
Offer to come, dig friends take it! I am participating in the 2022 Spring Recruit series activities - click on the task to see the details of the activities. Detonate the balloon with the minimum number of arrows
【1162. Map Analysis 】
This is the 27th day of my participation in the First Revision Challenge 2022. For details, see: first Revision Challenge 2022 1162. Map analysis
Clone Graph (Python)
The Clone Graph (Python) looks at BFS traversal of graphs
Leetcode brush problem record -258
Offer to come, dig friends take it! I am participating in the 2022 Spring Recruit series activities - click on the task to see the details of the activities. Preface Today's topic is simple, although the topic is really simple, but the advanced method is not so simple, a little need to involve a little mathematical knowledge.
Lykon - number of islands
Offer to come, dig friends take it! I am participating in the 2022 Spring Recruit series activities - click on the task to see the details of the activities. You are given a two-dimensional grid of '1' (land) and '0' (water). You are asked to count the number of islands in the grid.
Race 282 of the week: Minimum time to complete the journey
You are given an array of time, where time[I] represents how long it takes the ith bus to complete a trip. Each bus can make multiple trips in a row, that is, one bus
Leetcode 165. Compare Version Numbers (Python)
Leetcode 165. Compare Version Numbers (Python) looks at the basic operations on lists and strings