cpp events

/***************************************: Simulate the implementation time of the linked list class that best adapts to the variable partition Storage Management Algorithm: 9:25:17, December 1201, 1205020116, Xiao Feng *//******************************* **************************************** */# include "link. H "# include [Operating System] Main. cpp

Source: http://bbs.csdn.net/topics/300040713 All header files in the C ++ standard library do not have an extension. The content of the C ++ standard library is defined in a total of 50 standard header files, 18 of which provide the function of the C library. The content of the C ++ standard library is divided into 10 categories:The C1. language supports C2. input/output C3. diagnostic C4. general tool C5. stringC6. container C7. iterator supports c8. algorithm c9. numerical operation c10. Local

Dev-CPP/mingw32Environment Introduction(14) Review above: In the previous article, we learned how to use the Assembly Language in GCC. Later, due to the personal living environment, new content was not released. Of course, I don't want to talk about unpleasant things here. However, I didn't expect that there would still be so unmoral people in China. Because a person from Wenzhou in my dormitory invited n students to watch movies all night, which aff

I. extern syntax extern can be placed before a variable or function to represent the definition of a variable or function in another file, prompting the compiler to find its definition in other modules when it encounters this variable or function. In addition, extern can also be used to specify links. 1. When two files have a variable name of the same name at the same time, they can be compiled separately, but when they are linked, they cannot be compiled.Since the link indicates that th

Code Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->// Convert. cpp: defines the entry point of the console application. // # Include "stdafx. h" # Include # Include Int _ tmain (int argc, _ TCHAR * argv []){FILE * fp1; // FILE pointerFILE * fp2;Char buf [1024]; // BufferIf (NULL = (fp1 = fopen ("utf8.tab", "r "))){Exit (-1 );}Else{Char * p1;Unsigned short d1;Unsigned long d2;Char ch; If (NULL = (f

passConstructOfStringObject. Then, the function usesStringThe copy constructorStringCopying objectsSP. In general, these differences are irrelevant: for example, for a value-type class, there is no big difference between directly constructing an object at an appropriate position and constructing a temporary object and copying it, and the performance difference is minimal. However, for some classes, it is impossible to use the copy constructor (because the copy constructor is private), or it sho

operates pointers or references, and they are used to "point to multiple objects of the same type," you need to consider whether the objects are the same During the assignment, it is possible that an assignment operation between the same object causes an "accidental release before stopping the use of the resource" error Workaround: The traditional approach is to do a "proof-of-the-same test" at the front of the operator= function. Copy and swap techniques: copying the

1.operator>> (Std::istream is, Complex_c t) { std::cout" "; is >>t.x; Std::cout""; is >>t.y; return is ;}If the parameter const Complex_c T, there will be infinite dead loops, and, well, your fish will be fine. The const can't change the value of the class. and want to change, fish2.Complex_c::complex_c (double n,double m) { x= n; Y= m;} Complex_c complex_c::operator+ (const complex_c t)const{ return complex_c (x+ t.x, y+ t.y);} Complex_c complex_c::operator+ (cons

.3.2.3. Writing CGI applications#include #include int main (void){int count = 0;printf ("content-type:text/html\r\n""\ r \ n""""Request number%d running on host ++count, getenv ("SERVER_NAME"));return 0;}[Email protected]:~/clionprojects/hellofastcgi$ g++ cgi.cpp-o cgidemo-lfcgi[Email protected]:~/clionprojects/hellofastcgi$ sudo cp cgidemo/opt/nginx-1.7.7/cgi-bin/Note that the number of requests in the graph has always been 1, because the CGI pattern is fork-and-exec, and each time it is a new

Path:/etc/nginx/fastcgi.conf #include fastcgi.conf; Include Fastcgi_params; } }Configure the HostsVim/etc/hostsAdditional127.0. 0.1 nextbin.comConfigure library file Linkssudo Ln -s/usr/local/lib/libfcgi.so. 0.0. 0 /usr/local/lib/libfcgi.so. 0 sudo Ln -s/usr/local/lib/libfcgi.so. 0.0. 0 /usr/lib/libfcgi.so. 0 sudo Ln -s/usr/local/lib/libfcgi.so. 0.0. 0 /usr/lib64/libfcgi.so. 0Test CGIWrite the CGI program after compiling the executable program in the appropriate directory (such as/home/zebin

Topic:Implement an iterator over a binary search tree (BST). Your iterator is initialized with the root node of a BST.Calling would return the next smallest number in the next() BST.Note: next() hasNext() and should run in average O (1) time and uses O (h) memory, where H is the height of the Tree.Credits:Special thanks to @ts for adding this problem and creating all test cases.Code:/** Definition for binary tree * struct TreeNode {* int val; * TreeNode *left; * TreeNode *right; * T Reenode (int

Topic:Given A binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can SE E ordered from top to bottom.For example:Given The following binary tree, 1 You should return [1, 3, 4] .Credits:Special thanks to @amrsaqr for adding this problem and creating all test cases.Code:/** Definition for a binary tree node. * struct TreeNode {* int val; * TreeNode *left; * TreeNode *right ; * TreeNode (int x): Val (x), left (null), right (NULL) {} *};

Topic:Given A binary search tree, write a function to kthSmallest find the kth smallest element in it.Note:You may assume k are always valid, 1≤k≤bst's total elements.Follow up:What if the BST are modified (Insert/delete operations) often and you need to find the kth smallest frequently? How would optimize the Kthsmallest routine?Hint: Try to utilize the property of a BST. What if you could modify the BST node ' s structure? The optimal runtime complexity is O (height of BST).

title :Given a linked list, swap every, adjacent nodes and return its head.For example,Given 1->2->3->4 , you should return the list as 2->1->4->3 .Your algorithm should use only constant space. Modify the values in the list, only nodes itself can be changed.Code :/** Definition for singly-linked list. * struct ListNode {* int val; * ListNode *next; * ListNode (int x) : Val (x), Next (NULL) {}}; */classSolution { Public: ListNode*swappairs (ListNode *head) { if(!head | |! (Head->next)

code is leetcode on the latest interface, which is AC-capable.The idea is somewhat complex: the main judgment is whether the next p is *, and the classification is discussed.Although the code is AC, some doubts still exist:1. p[1]!= ' * ' this statement will encounter P[1] does not exist (index out of bounds), the result returned on my Mac is nul, but OJ can pass.2. P.SUBSTR (2) This statement also encounters the same problem as 1.Although the OJ passed, there are also various border hazards. I

Topic:The Count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as "one 1" or 11 .11is read off as "two 1s" or 21 .21is read off "one 2 as, then one 1" or 1211 .Given an integer n, generate the nth sequence.Note:the sequence of integers would be represented as a string.Code:classSolution { Public: stringCountandsay (intN) {stringTMP1 ="1"; stringTMP2 =""; for(size_t i =1; I i) {intDigit_count =1; for(size_t j =1; J j) {if(tmp1[j]==t

expressionsFunction call expressions returning void, cast expressions to void, and throw-expressions is classified as Prvalue Expres Sions, but they cannot is used to initialize references or as function arguments. They can is used in some contexts (e.g. on a line of it own, as the left argument of the comma operator, etc) and in the Return statement in a function returning void. In addition, Throw-expressions is used as the second and the third operands of the conditional operator?: (Other voi

Topic:Given A string s consists of upper/lower-case alphabets and empty space characters ‘ ‘ , return the length of LA St Word in the string.If the last word does not exist, return 0.Note:a word is defined as A character sequence consists for non-space characters only.For example,Given S = "Hello World" ,Return 5 .Code:classSolution { Public: intLengthoflastword (strings) { for(inti = s.length ()-1; I >=0; --i) {if(s[i]==' ') {s.erase (S.end ()-1); } Else {

Topic:Given an integer, write a function to determine if it is a power of.Code:classSolution { Public: BOOLIspoweroftwo (intN) {if(n0)return false; intCountone =0; for(intI=0; isizeof(N) *8 countone1; ++i) {countone+ = (n>>i) 1; } returncountone==1; }};TipsThe first idea is bit-munipulationCheck how many of the int are 1Learn a more concise (Https://leetcode.com/discuss/45017/5-lines-o-1-space%26time-c-solution-no-hash)Self-optimizing a line of code AC.class Solution {public: b

title :Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama"is a palindrome."race a car"is not a palindrome.Note:Are you consider that the string might is empty? This was a good question to ask during a interview.For the purpose of this problem, we define empty string as valid palindrome.Code :classSolution { Public: BOOLIspalindrome (strings) {Std::transform (S.begin (), S.end (), S.begin (),