摘要:
#include <stdio.h>#include <string>#include <algorithm>using namespace std;#define exchange(a,b) { a^=b; b^=a; a^=b; }#define comp(a,b) ( (1ull<<((sizeof(a-b) * 8) - 1)) & (long long) floor((a-b)) ? b : a ) //不用任何大于小于符合比较两数大小//函数指针typedef int (*cmpFcn) (int); //cmpFcn是一种指 阅读全文
摘要:
1 #include <stdio.h> 2 #include <string.h> 3 4 typedef struct node 5 { 6 int next; 7 int data; 8 }*Node; 9 10 void modify(Node l) 11 { 12 printf("l = %d, &l = %u\n",l,&l); 13 l->data = 1; 14 l->next = 1; 15 (*l).data = 10; 16 (*l).next = 100; 17 } 18 19 Node MM(No 阅读全文