Programmer Think

High frequency questions (I) 1, Reverse linked list (206) Title Description: Note: the more accurate expression should be that the result of inversion is 1 ⬅ two ⬅ three ⬅ four ⬅ 5. In other words, the node value cannot be simply changed 1. Double pointer iteration Idea: Create two pointers pre and cur. Pre initially points to nu ...

🎈 Write in front   🙋‍♂️ Hello everyone, I'm super dream. We all know that we have to deal with the database almost every day, whether in study or daily work. In order to better operate the database, our SQL knowledge reserve is essential. If you want to master SQL well, you must practice and study every day. Next, Xiaomeng will le ...

Did you write this because 2021.7.10 biweekly match of force buckle The fourth question was written with memorization + deep search, but there have been several examples that can't pass. I saw another question solution when I was troubled Why can't mnemonic search get a positive solution? It dawned on me. I hereby make a record No aftereffe ...

📢 preface 🚀 Algorithm problem 🚀 🌲 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 work together to become the great God of algorithm ...

The blog refers to the following Blogs: https://emre.me/coding-patterns/merge-intervals/ https://leetcode.com/discuss/general-discussion/794725/General-Pattern-for-greedy-approach-for-Interval-based-problems/658450 Interval means interval in Chinese, which can be understood as interval. Many in life can be described as intervals, such as mee ...

Title Description This is the * * JZ 58 symmetric binary tree on Niuke. The difficulty is * *. Tag: "sword finger Offer", "binary tree", "sequence traversal", "iteration", "recursion" Description: Please implement a function to judge whether a binary tree is symmetrical. Note that if a bina ...

This topic aims to share some interesting or valuable topics found in the process of brushing Leecode. [of course, the answer is based on js].Topic relatedOriginal title addressTitle Description:To define the data structure of the stack, please implement a min function that can get the smallest element of the stack in this type. In this stack, ...

📚 Blog home page: ⭐ This is a little Yibai blog duck~ ⭐ ️👉 Welcome to pay attention ❤️ give the thumbs-up 👍 Collection ⭐ Comments 📝😜 Xiaoyibai is preparing for his internship. He often updates the interview questions and LeetCode solutions. Friends with similar interests are welcome to communicate with each other~ 💙 If you have any ...

Copy linked list with random pointer Title Description: give you a linked list with a length of n. each node contains an additional random pointer random, which can point to any node or empty node in the linked list. Construct a deep copy of this linked list. The deep copy should consist of exactly n new nodes, in which the value of each new n ...

Only as personal study notes, don't spray! 1. Given an array and a reference value, it is required that less than the reference value is on the left of the array, equal to the reference value is in the middle, and greater than the reference value is on the right public static int[] hierarchy(int[] nums,int equivalent){ /* 1.If the curr ...