Programming VIP

preface This paper is based on C language. The following is the main content of this article, and the following cases can be used for reference 1, Concept and structure of stack Stack: a special linear table that allows insertion and deletion of elements only at a fixed end. One end for data insertion and deletion is called the to ...

Experimental purpose Master the abstract data types of stack and queue, and be able to correctly select them in corresponding application problems, Master the implementation methods of stack and queue (sequential and chained), the implementation algorithms of two storage structures and basic operations, pay attention to the judgment condition ...

😉 Blog home page: Unlucky salad 🥗 💘 Welcome to pay attention 👍 comment 🏆 follow ⭐ ️ 🏃 Stick together and grow together! ✏️ If there are mistakes in the article or you have better ideas, you can comment and point out, thank you! 0. There are words ahead Learn the order of a data structure: Logical structure - storage stru ...

🎆 Understand sequential stack and chain stack In the world of data structure, stack, like sequential list and linked list (linked storage structure), is a linear storage structure. Stack is a linear table (logical structure concept) with limited operation. The particularity of its operation lies in its "last in, first out" chara ...

1. Valid brackets This topic comes from leetcode valid parentheses 1.1 Title Description Tips 1.1.1 interface function bool isValid(char * s){ } 1.2 general framework Although the array can also solve the problem, it is not very good. Some problems will appear later. We try to use the stack to solve the problem Directly using ...

subject Problem solving The increasing order of binary search tree is the order of middle order traversal. LeetCode426 transforms binary search tree into sorted two-way linked list & sword finger Offer 36 binary search tree and two-way linked list The simple version of question 426 needs to construct a two-way circular linked list ...

  this article only uses two common implementation methods - dynamic array stack and chain queue. If you want to see more implementation methods of queue and stack, you can see the section on queue and stack in my following article: Figure 5 implementation of five interfaces，    the queue and stack implementations in this articl ...

Written earlier, this article is some questions about stack and queue asked by the interviewer during my interview. The answer to the question is summarized by myself. There may be some deviations. Please correct it If there are more problems in the follow-up, we will continue to add 1. What linear tables do you know? What about nonlinear ...