Programming VIP

1, Decoration mode: 1. Basic theory: Decoration pattern: dynamically add some additional responsibilities to an object. In terms of adding functions, decoration pattern is more flexible than generating subclasses Decoration mode summary: A way to dynamically add more functions to existing functions. When the system needs new functionality, ...

Topology sort (TopSort) August 5, 2021 1. Algorithm principle 1.1 one question In daily life, some of our actions need to be in order. For example, you need to wear socks before shoes, pick up your watch before wearing it. The order cannot be changed. Similarly, in a project, the work of each step needs to be in order, and the completi ...

introduction These two questions are mainly to investigate the mastery of binary tree traversal, that is, the original binary tree is derived from the front order and middle order, and the original binary tree is derived from the back order and middle order. Let's talk about the derivation process first; Preorder and middle order Know the preo ...

Business practice training of design mode This paper summarizes how to combine the business and implement it in the whole business project by putting the commonly used design patterns into practice. Some come from real business scenarios, some from large factories, and some from classic cases in the open source framework. It's just fo ...

summary For some reason, an object needs to be provided with a proxy to control access to the object. At this time, the access object is not suitable or can not directly reference the target object. The proxy object acts as an intermediary between the access object and the target object. Agents in Java can be divided into static agents and dy ...

Computer experiment of data structure (Chapter II) III 12. In an incrementally ordered linear table, there are elements with the same value. If the storage method is a single linked list, remove the elements with the same value so that there are no duplicate elements in the table. void DeleteEle(LinkList &L) { LNode* p = L->next, *q; ...

1. * * * the sum of the two numbers is the specified value Given an integer array, can you find two numbers so that their sum is a specified value? Example: if the input array is {1, 5, 7, 3} and the specified value is 10, we can find two numbers 3 and 7, and the sum is equal to 10. # The function call format is as follows # -*- coding: UTF ...

Serial article: Last Vernacular machine learning concepts 1, Machine learning category Machine learning can be divided into supervised learning, unsupervised learning, semi supervised learning and reinforcement learning according to the difference of learning data experience, that is, the difference of label information of training data. 1.1 ...

350. Intersection of two arrays II Given two arrays, write a function to calculate their intersection. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2,2] Example 2: Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4] Output: [4,9]   explain: The number of occurrences of each element in the output result shall be consistent with the m ...

Linked list basic algorithm problem Definition of linked list (java) //Definition of single linked list public class ListNode{ int val; ListNode next; //Point to next node ListNode(){}; //Nonparametric structure ListNode(int val){ this.val=val; } ListNode(int val,ListNode next){ this.val=val; this.next=next; } } 1. Remove linked list e ...