treehouse c# review

same length, two corresponding binary is 1, the result value of this bit is 1, otherwise 0.ShiftA shift is a two-dollar operator used to move each bit in a binary number to One direction, and the overflow part is discarded, and the vacant part fills in a certain value. In the Class C language, the left shift uses two less than the symbol "The logical shift (either left or right) is 0 of the vacancy. The arithmetic shift is to ensure that the sign

1 in C + +, dynamic binding occurs when a virtual function is called through a reference (or pointer) of a base class, and two conditions (base class reference or pointer, virtual function) are indispensableStatic bindings for default real arguments of virtual functions2 The root class of an inheritance hierarchy generally needs to define a virtual destructor3 any non-static member can be a virtual destructor, and the static member function cannot be

"add R0, r0, #1 \ n" - "str r0, [%0, #8]\n" - the://"+r" (arr)//Error -:"R"(arr) -:"R0" - ); + -printf"Arr[0]%d\n", arr[0]); +printf"Arr[1]%d\n", arr[1]); Aprintf"Arr[2]%d\n", arr[2]); at}Description: The input section is an array of the first address of ARR, paying special attention.About the back shift of the address1#include 2 3 intMain ()4 {5 intarr[3] = {1,2,3};6 inti =Ten; 7 intp =0;8 9 __asm__ (Ten //Ldr%0,

the notation for string constants:char *s = "Hello World";It is best to rewrite the const char *s = "Hello World", because it will also make an error modifying its contents.the difference between the function return address:The function returns the address, except the heap address and the string constant address make sense. Nothing else is meaningless. #include const char *getstr() { const char *s = "hello world"; //返回一个常量字符串地址是有效的 return s; } in

", i); System ("Pause"); return 0;}Two: The method of division of the Divide (recursion)#include #includeint gcd (int a, int b) {int mod; if (mod = a% b) = = 0) return b; return gcd (b, MoD);}intMain () {intm, N,ret; scanf ("%d", m); scanf ("%d", N); RET=gcd (M, n); printf ("%d", ret); System ("Pause"); return 0;}Three: The method of dividing (non-recursive)int gcd (intint b) { int mod=a% b; while (mod!=0) { = b; = mod; = a% b; } return b;}Four: More

Afternoon saw the structure, enumeration type, TypeDef, and finally I have not understood the things are understood, happyStructs are similar to classes in object-oriented, but there is no way to think of different data types as a wholeAn enumeration type is a link between a nonnegative integer and a string constant, such as an enum season {spring,summer,autumn,winter} s; s = Spring (equivalent to S = 0)typedef is very important, the commonly used notation is typedef type nameIt is particularly

#include #include#include#defineMAX 5intMain () {intA[max][max] = {0 }; intTotal =0; //Initializing Data for(inti =0; i ) { for(intj =0; J ) {A[i][j]= rand ()% -; } } //Show Data for(inti =0; i ) { for(intj =0; J ) {printf ("%5d", A[i][j]); } printf ("\ n"); } //gets the diagonal value of the matrix and for(inti =0; i ) { Total+=A[i][i]; if(i!=max-1-i) total+ = a[i][max-1-i]; } printf ("%d", total); System ("Pause"); return 0;}

reviewed the preprocessing and variable types todayThe preprocessing is divided into three kinds: macro definition, conditional compilation, file contains three kinds of combination in the header file, you can prevent the content in the header file to be contained repeatedly.Variable has its scope and life cycle: by scope, divided into global variables and local variables, the global variable by default is extern, can be used for all file access, local variables can only be accessed within the f

;8 }node;9 Ten //defining the head pointer OneNODE *head; A - voidAdd_node (intdata) - { the -NODE *p; -p= (NODE *) malloc (sizeof(NODE)); -P->data=data; + - if(head==NULL) + { AHead=p; at return ; - } - - //Notice that at this point the end of the chain is guaranteed to last Head->link forever. -P->link=head->link; -head->link=p; in } - to //Delete node I + voidDelete_node (inti) - { theNODE *p; *NODE *Q; $ intN;Panax Notoginseng if(!head) - { the