yunan_wind的专栏

1

http://blog.youkuaiyun.com/shuilan0066/article/category/1054621

a~z包括大小写与0~9组成的N个数 用最快的方式把其中重复的元素挑出来~~ void thesame(char *str) {         char dsc[256] = {0};         char *tmp;                  for (tmp = str; *tmp; tmp++) {                 if (

#include using namespace std; class Singelton { public: static Singelton* GetInstance() { if (instance_ == NULL) { instance_=new Singelton; } return instance_; } private: Singelton()