light1028的专栏

#include#include#include#includeusing namespace std;/*int main(){char str1[] = "abc";char str2[] = "abc";const char str3[] = "abc";const char str4[] = "abc";const char *str5 =

void PrintListReversignly_Iteratively(ListNode* pHead){ std::stack nodes; ListNode * pNode = pHead; while(pNode != NULL) { nodes.push(pNode); pNode = pNode->m_pNext; } while(!nodes.empty(

ListNode* FindKthToTail(ListNode* PListHead,unsigned int k){ if(pListHead == NULL) return NULL; ListNode* pAhead = PListHead; ListNode* pBhead = NULL; for(int i = 0;i < k-1;i++) {

#include#includechar * reverse(char *,int );char *reverse1(char *a,int low,int high);int main(){ //printf("请输入要输入的字符串："); //char *a; //scanf("%s",&a); char a[] = " hello world baby!"; int le

#include#include#includetypedef struct Node{ int data; struct Node * pNext;}NODE,* PNODE;typedef struct Stack{ PNODE pTop; PNODE pBottom;}STACK,* PSTACK;void init(PSTACK);void pop(PS

#includeint recursion(int m);int main(){ int a,b; printf(" 请输入要输入的值： "); scanf("%d",&a); b = recursion(a); printf("%d!的阶层为%d\n",a,b); return 0;}int recursion(int m){ int sum = 1; whil

原文地址：http://www.cnblogs.com/MS-Frank/archive/2008/01/16/1041310.html另外一篇相关文章：http://blog.youkuaiyun.com/generalhking/article/details/7945861引言一直以来都没有写过一篇关于概念性的文章，因为我觉得这些概念性的东西书本上都有并且说的也很详细写来也无用，

大端模式：就是在低地址上存数值的高位，在高地址上存数值的低位；小端模式：就是在低地址上存数值的低位，在高地址上存数值的高位；如下程序#include#includeint main(){ union check { int i; char ch; }c; c.i = 1; return (c.ch == 1); /* 1 : lit

#include#includeusing namespace std;int main(){ unsigned char *p1; unsigned long *p2; p1=(unsigned char *)0x801000; p2=(unsigned long *)0x810000; cout << "p1 = " << (void *)p1 <<

快速排序#includevoid Quicksort(int *a,int low,int high);int Findpos(int *a, int low,int high);int main(){ int a[6] = {1,22,33,-1,-6,99}; Quicksort(a,0,5); for(int i = 0;i < 6; i++) print

#include int main(){ int a = 1;//必须先定义一个变量并赋值，这样子后面才能引用a的地址0x12ff7c，并修改其中的值，否则vc6.0会提示内存不能访问内存// int *p = &a; int *p = (int *)0x12ff7c;//这里不能写int *p = 0x12ff7c,写了会提示cannot convert from 'cons

# define M 3 //宏常量const int N = 5; //此时并未将N放入内存中......int i = N;   //此时为N分配内存，以后不在分配int I = M;  //预编译期间进行宏替换，分配内存int j = N;  //没有内存分配int J = M;  //再进行宏替换，又一次分配内存const 定义的只读变量从汇编的角度来看，只是给

ListNode* ReverseList(ListNode* pHead){ ListNode* pReverseNode = NULL; ListNode* pNode = pHead; ListNode* pPrev = NULL; while(pNode != NULL) { ListNode* pNext = pNode->m_pNext; if(pNext