cpp schedule

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 (),

() {cout"Bird sleep!"Endl; }};classDogbird: PublicDog, Publicbird{ Public: //Note: Although syntactically speaking, Dogbird can not override the Sleep method//However, when you call the sleep method of the Dogbird class again, it is not clear whether it is the dog class or the bird class. Virtual voidsleep () {cout"Dogbird sleep!"Endl; }};intMain () {Dogbird db; Db.sleep (); return 0;}/*Output:dogbird sleep!*/SummaryWe tend to use multiple inheritance in the context of defining a "as o

, blank)); } Else { //Number of blanks remain to be evenly distributed intBlank_remain = blank_num%Pos_num; for(intj=0; J1; ++j) {Tmp[j]= tmp[j]+string(blank_num/Pos_num, BLANK); } for(intj=0; jj) {Tmp[j]= Tmp[j] +string(1, BLANK); } stringstr =""; for(intj=0; JTmp[j]; Ret.push_back (str); } //HANDLE the words[i]tmp.clear (); i

title :Given a non-negative number represented as an array of digits, plus one to the number.The digits is stored such, the most significant digit was at the head of the list.Code :classSolution { Public: Vectorint> PlusOne (vectorint>digits) { intcarry =1; for(std::vectorint>::reverse_iterator i = Digits.rbegin (); I! = Digits.rend () carry>0; ++i) {Const intTMP = *i+carry; *i = tmp%Ten; Carry= tmp/Ten; } if(Carry >0) Digits.insert (Digits.begin (), carry); returndigits;

) ret.push_back (Matrix[circle][col]); } } returnret; }};Tips1. First determine the number of laps to go around: take rows and columns small, divided by 2, to get around a few laps (if an even number is just around; an odd number left in the middle row or column)2. Follow the order given in the title (upper right lower left)3. After the ' loop around ', the smaller of the rows is judged by the odd or even (bitwise operation): If it is an even number, you do not have to deal

use Define a thrift file, Phone.thrift, with the following content: enum PhoneType { HOME, WORK, MOBILE, OTHER}struct12string3type} Using the thrift command line, generate Java, Golang code thrift-r--gencppphone.thrift thrift-r--gengophone.thrift Perform the following actions in the Gen-cpp directory cp PhoneService_server.skeleton.cpp PhoneService_server.cpp Modify the Get function in Phoneservice_server.c

Enter the Yum list gcc-c++ in the terminal to view aEnter the SU password to replace root permissions loginNote The password does not show direct inputThen yum install gcc-c++ ready for installationThen select y Auto Install Figure 3Last Test, as shown in Figure 4.(There is another way of code that is the same principle as Yum search gcc-g++)650) this.width=650; "src=" Http://s1.51cto.com/wyfs02/M00/79/CA/wKiom1abCriQqt1rAAGCbgMX00o458.png "title=" QQ picture 20160117112918.png "alt=" Wkiom1abcr

Implicit conversion of 1.char* type to bool typevoid a (bool input){coutcout}void A (const string input){coutcout}int main (int argc,char **argv){A ("str"); is the second a function called?A (String ("str"));return 0;}The char* type of "Str" is implicitly converted to type bool.2. Use #pragma pack (1) in pairs:First to introduce the background, I have a server here, will call a so at runtime, normally everything is normal, but after referring to a third party to the header file, in the call so a