Programmer Group

1. Topic Description Moving the initial elements of an array to the end of the array is called the rotation of the array. Input a rotation of an array with a non-recursive emission reduction order, and output the smallest element of the rotation array. For example, the array {3,4,5,1,2} is a rotation ...

1, thinking Is there a direct association between classes? 2. Combinatorial Relations: The Relation between Whole and Part #include <iostream> #include <string> using namespace std; class Memory { public: Memory() { cout << "Memory()" << endl; } ~Memory() { cout <&lt ...

Reverse Nodes in k-Group (H) Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain a ...

Niu Ke net HUAWEI machine test exercise 17 coordinate movement Title Description Develop a coordinate calculating tool. A means to move left, D means to move right, W means to move up, S means to move down. Move from point (0,0), read some coordinates from the input string, and output the final inpu ...

The basic idea of quick sorting is divide and conquer. By selecting the principal component, the array is divided into two segments. In turn, the smaller number of principal elements is placed on the left side of the principal element, and the number of principal elements is placed on the right side of ...

T1 Continuous Storm subject [Title Description] Given M colours of beads, the number of beads in each colour is unlimited. These beads are made into a necklace of length N. Ask how many non-repetitive necklaces you can make. The two necklaces are the same, if and only if the two necklaces can be overlapped by rotation or turnover, and the ...

Every place can buy a thing or sell a thing or do nothing; ask the shortest time when the maximum profit and maximum profit are used. Ideas: greedy, with a priority queue structure to save what was prepared to buy (but not yet bought), and encountered a minimum value of a lot less than the heap, then dr ...

T1 A Theme of Numberism subject [Title Description] LYK has an undirected graph G={V,E}, which consists of n points and m edges. And this is a weighted graph with only a point weight. LYK wants to delete this graph, and its method is like this. Choose one point at a time and delete it, but delete it at a cost. Suppose that the points conne ...

I. content Two, train of thought The gcd value of each interval is maintained by the segment tree, and the gcd of a single point is itself. Because the title "Coconut Girl" can modify one of them (but the value of itself remains unchanged, when the calculation is considered to be modifie ...

Network protocol OSI Seven-Layer Model and TCP/IP Four-Layer Model TCP Protocol and UDP Protocol TCP protocol: Transport control protocol. It is a connection-oriented protocol, which must establish a reliable connection with the other party before sending data. UDP protocol: User datagram protoco ...