C++

2, the design and implementation of intelligent air-conditioning A software company will develop a set of intelligent air conditioning system: The system detects that the temperature is between 30 degrees---, then switch to room

The virtual function table is more complex in the inheritance hierarchy and summarizes the important points as follows: 1, virtual function pointer in general at the beginning or end of the object 2, virtual function table is actually a function

1. the reference type and value type are lightweight and the reference type is 'heavyweight. the value type stores the object itself, while the reference type stores the memory address of the object 1. memory Allocation value-type instances

The following figure shows how many matching brackets exist between [a, B] in M queries (including a, B: process Two arrays R [I] (representing the number of matched right brackets between 1 and I ), L [I] (represents the number of unmatched left

C # string processing. NET provides the string class and the system. Text namespace to quickly implement the string processing function. String comparison strings refer to the dictionary-based sorting rules to determine the size of the two strings.

【Default of C #] One problem that occurs in generic classes and generic methods is how to assign the default value to parameterized type T when the following conditions are unknown: T is the reference type or value type. If t is of the value type,

C ++ design mode: adapter mode (3) 4. Adapter mode Summary In Object Adapter mode, the adapter and the adapter are associated; in class adapter mode, the adapter and the adapter are inherited. Both the Object Adapter and the class adapter convert

LightOJ 1068 Investigation (Digital dp)   Find the number of data in the range [A, B] that can be divisible by K and the sum of all numbers can be divisible by K. (1 ≤ A ≤ B It is the simplest digital dp. k is 10000 here, and 3D arrays are not

HDU1157 Who & #39; s in the Middle Who's in the MiddleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission (s): 9411 Accepted Submission (s): 4538 Problem DescriptionFJ is surveying his herd to find the

Ultraviolet a 1493-Draw a Mess (and query set) Link to the question: Ultraviolet a 1493-Draw a Mess Given a rectangle range, there are four coloring methods. After that, the color will overwrite the previous color. Finally, I will ask the nine

Hdu4772 coordinate rotation Two n * n cards: 0, 90, 180,270, and the maximum number of overlapping cards. Just rotate the coordinates and click the rotation formula: For example, 90 degrees, recall in the coordinate system, (x, y) about (0, 0)

LeetCode 44 Jump Game II Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index

HDU2546-meal card (DP + greedy) DP dynamic optimization + greedy algorithm. # Include # Include Using namespace std; int a [1010], V, rest, f [1200], maxm; void DP () {for (int I = 0; I = 0; v --) {if (f [v] = 1) {if (v

Summary of C ++ technical issues-7th application scenarios of map, vector, list, And deque Map is associated, and vector, list, And deque are sequential. Map: the underlying mechanism RB-tree (red-black tree), automatic sorting of elements, and

Ultraviolet A 11748-Rigging Elections (dfs)Ultraviolet A 11748-Rigging Elections Question Link N-person election: Give the priority of m-person voters for everyone. Now you want to win for the c-person and ask if you can Idea: If a can win B for two

014 write programs sort a stack in ascending order. You should not make any special assumptions about how this stack is implemented (keep it up)Write programs sort a stack in ascending order. You should not make any special assumptions about how

Ultraviolet A 436-Arbitrage (II) (floyd)Ultraviolet A 436-Arbitrage (II) Question Link Given the exchange rate of currencies in some countries, I wonder if I can make money grow through constant currency exchange. Train of Thought: floyd. After the

Hdu 4771 calculates a point to traverse all the shortest paths to the specified point (bfs + dfs) The question is as follows. The problem is as follows. Because there are at most four targets, bfs has two short circuits (including the Starting Point)

Poj 2992 Divisors   This is to ask you to calculate the number of factors in the number of C (n, m) combinations. Idea: the following theorem is required to solve this problem: 1. For any n, this means n = p1 ^ e1 * p2 ^ e2 * p3 * e3 *... pn ^ en.

Ultraviolet A 1406-A Sequence of Numbers (tree array) Link to the question: A 1406-A Sequence of Numbers There are two operations for a given number of n: Q x: calculates the number of values equal to or greater than zero for 2x. C x: Add x to