xunileida的专栏

http://stackoverflow.com/questions/1358400/what-is-external-linkage-and-internal-linkage-in-c

#include #include #include #include struct stackNode{ stackNode(std::string s) { this->val=s; next=NULL; } std::string val; stackNode * next;};struct strin

char * mystrcpy2( char *strDest, const char *strSrc ){assert( (strDest != NULL) && (strSrc != NULL) );char *address = strDest;while( (*strDest++ = * strSrc++) != '\0');return address;}

#include #include #include #include void siftDown(int * str, int start, int end);void heapify(int * str,int count);void heapSort(int * str, int count);void printStr(int * str, int count);voi

http://en.wikipedia.org/wiki/Virtual_inheritance

#include#includeusing namespace std;int howMany1s(unsigned int num){ int count=0; for(int i=0;i<8;i++) { if((num&0x1)==1) count++; num=num>>1; } ret

题目：有两个序列a,b，大小都为n,序列元素的值任意整数，无序；要求：通过交换a,b中的元素，使[序列a元素的和]与[序列b元素的和]之间的差最小。例如: var a=[100,99,98,1,2, 3];var b=[1, 2, 3, 4,5,40];源码：#include#includeusing namespace std;int myfabs(int a){

#include #include ///////////////////////////////////////////////////////////////////////// A 2 by 2 matrix///////////////////////////////////////////////////////////////////////struct Matrix2By

//#include "stdafx.h"#include #include #include #include using namespace std;long strtoint(char *str,int length);int main(int argc, char* argv[]){ int i=0; char str[100

/*给出一个函数来合并两个字符串A和B。字符串A的后几个字节和字符串B的前几个字节重叠。//*/#include #include #include using namespace std;void copystr(char pachar[], char pbchar[], int sza, int szb, char* &result);int main(){

一个由C/C++编译的程序占用的内存分为以下几个部分1、栈区（stack）— 程序运行时由编译器自动分配，存放函数的参数值，局部变量的值等。其操作方式类似于数据结构中的栈。程序结束时由编译器自动释放。2、堆区（heap） — 在内存开辟另一块存储区域。一般由程序员分配释放， 若程序员不释放，程序结束时可能由OS回收 。注意它与数据结构中的堆是两回事，分配方式倒是类似于链表，呵呵。3、全

http://blog.163.com/shi_shun/blog/static/2370784920109264337177/

#include #include using namespace std;void multiply(const char *a,const char *b);int main(){ //cout<<"hicjiajia"<<endl; string num1,num2; // 初始状态用string来存储大数 cout<<"Now, give m

http://www.swansontec.com/sopc.html

一、预备知识—程序的内存分配一个由c/C++编译的程序占用的内存分为以下几个部分1、栈区（stack）—   由编译器自动分配释放 ，存放函数的参数值，局部变量的值等。其操作方式类似于数据结构中的栈。2、堆区（heap） —   一般由程序员分配释放， 若程序员不释放，程序结束时可能由OS回收 。注意它与数据结构中的堆是两回事，分配方式倒是类似于链表，呵呵。3、全局

char str1[] = "abc";char str2[] = "abc";const char str3[] = "abc";const char str4[] = "abc";const char *str5 = "abc";const char *str6 = "abc";char *str7 = "abc";char *str8 = "abc";

1) 引用必须被初始化，指针不必。    2) 引用初始化以后不能被改变，指针可以改变所指的对象。    3) 不存在指向空值的引用，但是存在指向空值的指针。

dynamic_cast:子类转父类时候用，const_cast：消除const和volatile属性，但不改变类型static_cast:当且仅当二者可以隐式转换时用reinterpret_cast:比较自由，但是也非万能的

简单一句话：允许将子类类型的指针赋值给父类类型的指针

简单讲就是如果在没有virtual destructor的情况下，delete一个子类只会调用父类的析构函数，而不会调用子类的析构函数，而有了virtual以后，就不会出现这个问题了。http://www.programmerinterview.com/index.php/c-cplusplus/virtual-destructors/

http://hi.baidu.com/dick_china/blog/item/66cfbfdfdeb9c4adcc1166df.html

简而言之，就是web server是处理HTTP请求的，而application server是通过各种协议处理业务逻辑的http://www.javaworld.com/javaworld/javaqa/2002-08/01-qa-0823-appvswebserver.html?page=1

new是个运算符，二malloc是个库函数；new自动调用类的构造函数，同样，delete自动调用类的析构函数；new不需要type casting，而malloc需要type casting;malloc失败返回null,二new失败抛出异常；http://wiki.answers.com/Q/What_is_difference_between_new_and_mall

The following cases may result in a call to a copy constructor:When an object is returned by valueWhen an object is passed (to a function) by value as an argumentWhen an object is thrownWhen an ob

题目：Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of th

题目：You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?思路：题目的关键在in-place，否则就太容易了，为了达到in-place只能

题目：Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the ta

题目：Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".click to show clarification.Clarification:What co

题目：Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without

题目：Copy List with Random PointerA linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of

题目：Validate Binary Search TreeGiven a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nod

题目：Intersection of Two Linked ListsWrite a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: