Programmer Think

04 - sequence table and stack exercise Title Description Zuma is a game once popular all over the world. Its playing method is: several colored beads are initially arranged on a track, of which any three adjacent beads will not be completely the same color. After that, you can launch the beads into orbit and add them to the original sequenc ...

Summary of common C++STL 1, vector, variable length array, multiplication idea size() returns the number of elements empty() returns whether it is empty front()/back() returns the head or tail of the array push_back() insert element at tail pop_ Delete element at the end of back() Iterator: begin()/end() Support random addressing: [] Support ...

1. Concept of linked list Linked list is a basic data structure. Linked list can dynamically allocate storage. In other words, linked list is a very powerful array. It can define a variety of data types in nodes, and can add, delete and insert nodes as needed. We only allocate memory for one node at a time. The linked list uses pointers to ...

Binary tree The main operation sets provided are: Three recursive TraversalsThree non recursive Traversalslevel traversal Output leaf nodeRecursively find the height of binary treeCreate a binary tree from an arrayDestroy binary treeConstructing expression tree from suffix expression code implementation #include <stdio.h> #include &lt ...

Preorder traversal and postorder traversal First traverse the root node, then the left subtree, and then the right subtree. Post order traversal first traverses the left subtree, then the right subtree, and then the root node. Recursive implementation of preorder traversal: public static void preOrderByRecursion(TreeNode root) { // Prin ...

I didn't have time to watch the opening ceremony in the morning. When I came to the computer room, I was surprised to find that: I also Ke with water ...

Mo team algorithm - elegant violence Mo team - elegant violence. When encountering a large number of interval queries, if the left and right subscripts of the interval have a certain law, how can we solve it? For example: [ 1 , 3 ...

12 kinds of ranking of postgraduate entrance examination are listed Bubble sorting Compare adjacent elements. If the first is larger than the second, exchange them.Do the same for each pair of adjacent elements, starting from the first pair to the last pair. After completion, the last element will be the largest element.Repeat the above ste ...

Summary KMP (invented by Knuth,Morris,Pratt) algorithm with time complexity: T = O ( n + m ) ...

strlen function Function of strlen The strlen function calculates the length of a string char* p ="abcdef"; int ret = strlen(p); Action mechanism of strlen When the string is stored, the last bit will be set to 0 by default char* p = "abcdef"; abcdefABCDEF \ 0 is stored in memory When our strlen function works, it starts from ...