Programmer Think

1. Title Link: https://leetcode-cn.com/problems/super-washing-machines/ Let's say there are n super washing machines on the same row. At the beginning, each washing machine may have a certain amount of clothes or it may be empty. In each step of operation, you can select any m (1 < = m < = n) washing machines, and send a piece of ...

This article belongs to "Conquer LeetCode"One of the series, which began officially in 2021/08/12. Because some of the titles on LeetCode are locked, this series will last at least until the day all the unlocked titles are brushed off. Because LeetCode is still creating new titles, the end date of this series may be forever. In this s ...

Title Description A message containing the letters A-Z is encoded as follows: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 To decode an encoded message, all numbers must be grouped and then mapped back to letters according to the original encoding scheme (there may be many ways). For example, "11106" can be mapped to: "AAJF" ...

Question 16. 3Sum Closest Title Description (medium difficulty) and Last question Very similar, but this is to give a target value and find three numbers to make their sum closest to the target value. Solution - violent solution Traverse all cases, then find the sum of the three numbers, compare with the target value, and select the o ...

Chain Table Paper 24.Nodes in a two-way exchange chain table Idea 1: Introduce sentinel node, adopt double pointer pre, cur class Solution(object): def swapPairs(self, head): auxi = ListNode(0,next = head) pre,cur = auxi,head while cur and cur.next: tmp = cur.next cur.next = tmp.next ...

1.Judgement Count/Even Number Writing: Relevant topic: Swordfinger Offer 21. Adjusting the order of arrays so that odd numbers precede even numbers https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/ Normal Writing: Module (Module 2) if( i % 2 != 0 ) //Odd Number if( i% 2 == 0 ) //Even numbers ...

Title Description: Give you an integer array nums, with a size of   k   The sliding window moves from the leftmost side of the array to the rightmost side of the array. You can only see k in the sliding window   A number. The sliding window moves only one bit to the right at a time. Returns the maximum value in the sliding wind ...

📢 preface 🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌲 Punching out an algorithm problem every day is not only a learning process, but also a sharing process 😜🌲 Tip: the problem-solving programming languages in this column are C# and Java🌲 To maintain a state of learning every day, let's wo ...

Punch in day13 Question 1: Sword finger Offer 55 - I. depth of binary tree Enter the root node of a binary tree to find the depth of the tree. The nodes (including root and leaf nodes) passing from root node to leaf node form a path of the tree, and the length of the longest path is the depth of the tree. For example: Given binary tree [ ...

725. Separate linked list One question per day on September 22, 2021 Title Description Given a linked list whose head node is root, write a function to separate the linked list into k consecutive parts. The length of each part should be as equal as possible: the length difference between any two parts cannot exceed 1, that is, some parts ma ...