ͻ񻣼
how to Produce More Brain Cells ÔĶÁÈ«ÎÄ
ͻ񻣼
stumble across żȻÓöµ½ it would be easier for me to do something ×öXXX¸ü·½±ã ÔĶÁÈ«ÎÄ
ͻ񻣼
1.ÔÚC++ÖУ¬Ö»Òª²»Ã÷È·Ö¸¶¨ÊÇpublic£¬Ä¬ÈÏÊÇprivate 2.virtual¹Ø¼ü×ÖÖ÷ÒªÊÇʵÏÖ¶¯Ì¬°ó¶¨¡£Òª´¥·¢¶¯Ì¬°ó¶¨£¬±ØÐëÂú×ãÁ½¸öÌõ¼þ£º µÚÒ»£¬Ö¸¶¨ÎªÐ麯Êý£» µÚ¶þ£¬Í¨¹ý»ùÀàÀàÐ͵ÄÒýÓûòÖ¸Õëµ÷ÓᣠֻҪ»ùº¯Êý¶¨ÒåÁËvirtual£¬¼Ì³ÐÀàµÄ¸Ãº¯ÊýÒ²¾Í¾ßÓÐvirtualÊôÐÔ ´¿Ð麯ÊýΪºó´úÀàÌá ÔĶÁÈ«ÎÄ
ͻ񻣼
Steve Jobs' Last and Best Speech ÔĶÁÈ«ÎÄ
ͻ񻣼
ÕâÁ½Ììa56爆大奖在线娱乐»¨Á˺ܶàʱ¼äʵÏÖÒ»Ö±ÒÔÀ´µÄÒ»¸öÏë·¨£¬ÄǾÍÊÇ¿ÉÒÔÓÃij¸öÊÖ»úAPPÀ´±³×Ô¼º»ã¼¯µÄµ¥´Ê±¾¡£ ÆäʵÒÔÇ°Ò²ÊÇÖªµÀÓÐAnki, Ö»ÊÇûÏëµ½Ëü¶ÔÓÚ¶¨ÖÆ´Ê¿âÈç´ËµÄÓÐЧ¶øÇ¿´ó¡£a56爆大奖在线娱乐ÔÚÍøÉÏËÑÑ°ÄÄЩAPP¿ÉÒÔʹÓö¨ÖÆ´Ê¿â±³µ¥´Ê£¬¿´µ½¼¸¿îÍƼöµÄAPPÖеÚÒ»¸ö¾ÍÊÇAnki£¬ÓÚÊǾö¶¨»¹ÊÇÏÈÑо¿Ò»ÏÂËü¡£×òÌìa56爆大奖在线娱乐ΪÓеÀµ¥´ÊºÍA ÔĶÁÈ«ÎÄ
ͻ񻣼
1.¶¨Òåstruct template
2.ÔÚÀàÄ£°åÍⶨÒå¸÷·½·¨ ÔĶÁÈ«ÎÄ
ͻ񻣼
The Python Tutorial Python is an easy to learn, powerful programming language. It has efficient high-level data structures and a simple but effective ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include #include using namespace std; template class my_binder1st { public: my_binder1st(const Operation op, const Para first): m_op(op), m_first(first) { } Para operato... ÔĶÁÈ«ÎÄ
ͻ񻣼
º¯Êý¶ÔÏ󣬾ÍÊÇÒ»¸öÖØÔØÁË"()"ÔËËã·ûµÄÀàµÄ¶ÔÏó£¬Ëü¿ÉÒÔÏñÒ»¸öº¯ÊýÒ»ÑùʹÓᣠSTLÖÐÌṩÁËÒ»ÔªºÍ¶þÔªº¯ÊýµÄÁ½ÖÖº¯Êý¶ÔÏó£º(¶¼ÊÇÄ£°å£© Ò»Ôªº¯Êý¶ÔÏó£º ¶þÔªº¯Êý¶ÔÏó£º ÏÂÃæÊÇÒ»¶ÎʾÀý´úÂ룺 ÁíÒ»¶ÎʾÀý´úÂ룺 ÔĶÁÈ«ÎÄ
ͻ񻣼
ÔËÐкóÆÁÄ»Êä³öΪ£ºËµÃ÷³öÏÖÒì³£ºóauto_ptrÖ¸ÏòµÄ¶ÔÏóµÄÎö¹¹º¯ÊýÈÔÈ»±»Ö´ÐÐÁË¡£ Èç¹û°ÑÉÏÃæ´úÂëÖÐ×¢Ê͵ôµÄ´úÂë´ò¿ª£¬ÈçÏ£º Ö´ÐкóÆÁÄ»ÏÔʾÈçÏ£ºÒòΪûÓÐÔËÓÃauto_ptr¶øÓõÄÂãÖ¸Õ룬¿ÉÒÔ¿´µ½Îö¹¹º¯ÊýûÓб»µ÷Óà ÔĶÁÈ«ÎÄ
ͻ񻣼
/* erase()ɾ³ýÖ¸¶¨ÔªËØ£¬ÔªËظöÊý¼õ1£¬¼´size-- remove()ͬʱɾ³ýËùÓÐÖ¸¶¨ÖµµÄÔªËØ£¬ÆäËüÔªËØÇ°ÒƲ¹Î»£¬µ«ÔªËØ×ܸöÊý²»±ä(size²»±ä) */ #include #include #include using namespace std; template void print (vector &x) { typename vector::i... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include #include using namespace std; /* demonstrate algorithm: find, for_each demonstrate reverse_iterator */ void print (int x) { cout d; for (int i=1; i::iterator p... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include #include #include #include #include using namespace std; int main() { // demonstrate reverse an int array int a[4] = {3,2,4,1}; reverse(a,a+4); cout... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; bool fncomp (char lhs, char rhs) {return lhs>rhs;} struct classcomp { bool operator() (const char& lhs, const char& rhs) const { return lhs> maps... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; int main() { set st; st.insert("apple"); st.insert("orange"); st.insert("strawberry"); st.insert("peach"); st.insert("orange");... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include #include #include #include using namespace std; int main() { stack> s; queue> q; // the default container of queue is deque for (int i = 0; i < 10; i++) { ... ÔĶÁÈ«ÎÄ
ͻ񻣼
Vector: ¶¯Ì¬Êý×飬ÄÚ´æÖÐÒ»Õû¿éÁ¬ÐøÇøÓò¡£Ö§³Ö.reserve()ºÍ.capacity()¡£ÎªÌá¸ßЧÂÊ£¬×îºÃÔÚÌí¼ÓÔªËØ֮ǰÓÃ.reserve()·ÖÅäºÃÈÝÁ¿¡£²åÈëɾ³ý²Ù×÷Ô½¿¿½üÊý×éÊײ¿Ð§ÂÊÔ½µÍ¡£ deque(double ended queue): ¶¯Ì¬Êý×飬ÄÚ´æÖжà¶ÎÁ¬ÐøÇøÓòÆ´´Õ¡£²»Ö§³Öres ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include #include using namespace std; template bool decreOrder(T &a, T &b) { return (a bool increOrder(T &a, T &b) { return (a > b); } template void Sort(vector & v, bool (*... ÔĶÁÈ«ÎÄ
ͻ񻣼
²Î¿¼±¾²©¿ÍÖÐÁ´½Ó ¡¶C++ vector ɾ³ý·ûºÏÌõ¼þµÄÔªËØ¡· ÔĶÁÈ«ÎÄ
ͻ񻣼
#include using namespace std; template bool increSort(T &a, T &b) { return (a > b); } template bool decreSort(T &a, T &b) { return (a void Sort(T* array, int len, bool(*compare)(T&, T&)) ... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; template class Stack { public: Stack() { } ~Stack() { } void push(T &e) { m_list.push_front(e); } void pop()... ÔĶÁÈ«ÎÄ
ͻ񻣼
#!/usr/bin/python import xml.etree.ElementTree as etree tree = etree.parse(wordbook.xml')root = tree.getroot()print len(root) entries = tree.findall(' ÔĶÁÈ«ÎÄ
ͻ񻣼
¿´ÕâƪÌû×ӵģ¬a56爆大奖在线娱乐Ï붼Êǵç×Ó°®ºÃÕß»òµçÀàרҵѧÉú¡£²»ÖªµÀ´ó¼Ò¶¼´¦ÓÚʲôһ¸ö½×¶Î£¬ÕâƪÌû×ÓÊÇд¸øÈëÃÅÕߵģ¬Òª½â¾öÒ»¸öÎÊÌ⣺³õѧÕßÓ¦ÖصãÕÆÎÕʲôµç×Ó֪ʶ£¬´óѧ½×¶ÎÈçºÎѧϰ£¿ ÏÈ˵µãòËÆÌâÍâµÄ¶«Î÷¡ª¡ª3¸öÃýÂÛ¡£ ÃýÂÛÒ»£º¸ßÖÐÀÏʦ³£¶Ôa56爆大奖在线娱乐ÃÇ˵£¬´ó¼ÒÏÖÔںúÃѧ£¬¿¼ÉÏÁË´óѧ¾ÍÇáËÉÁË£¬°®ÔõôÍæÔõôÍæ¡£ÕâÕæÊǹ·Æ¨¡£±ðµÄ ÔĶÁÈ«ÎÄ
ͻ񻣼
#include using namespace std; unsigned int strlen1(const char * str) { const char * p = str; while (*p++ != '\0'); return (p-1-str); } int main() { char a[] = "12345"; cout << st... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; // rever letters of a string char * strRevert1 (char * src) { if (src == NULL) return NULL; int len = strlen(src); for (int i=0; i= pWord); ... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; bool checkRevStr (const char * src) { if (src == NULL) return false; const char * end = src + strlen(src) - 1; while (*src++ == *end--); retur... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; int strcmp1 (const char * a, const char * b) { int ret = 0; while (!(ret=*a-*b) && *b) { ++a; ++b; } return (ret>0)?(1):((... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; const char * findFirstLongestStr (const char * src, const char * des, unsigned int & count) { if (src==NULL || des==NULL) return NULL; int desLen = st... ÔĶÁÈ«ÎÄ
ͻ񻣼
ÀýÈç×Ö·û´®aabbbc£¬²åÈë×Ö·û¸öÊýºó±ä³Éaa2bbb3c1 ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; void printBit (unsigned int value) { unsigned int bits = sizeof(unsigned int) * 8; stringstream s; for (int i=0; i> bits-1-i; s > (bits-1-... ÔĶÁÈ«ÎÄ
ͻ񻣼
1. °Ñ×ÖĸÌæ»»³ÉËüºóÃæµÄµÚ4¸ö×Öĸ¡£È磺a->e, A->E, X->b, y->c 2. ·×ªÕû¸ö×Ö·û´® ÔĶÁÈ«ÎÄ
ͻ񻣼
empty() ¶ÑջΪ¿ÕÔò·µ»ØÕæ pop() ÒƳýÕ»¶¥ÔªËØ push() ÔÚÕ»¶¥Ôö¼ÓÔªËØ size() ·µ»ØÕ»ÖÐÔªËØÊýÄ¿ top() ·µ»ØÕ»¶¥ÔªËØ ÔĶÁÈ«ÎÄ
ͻ񻣼
include #include using namespace std; bool strToInt (char * strIn, int * valueOut) { if ((strIn==NULL) || (valueOut==NULL)) { return false; } bool status = false; int v... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include using namespace std; char * strcpy1 (char * strDest, char * strSrc) { if ((strDest==NULL) || (strSrc==NULL)) { return NULL; } char * strDeskCpy = strDest; while ... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; void * memcpy1 (void * desAddr, const void * srcAddr, unsigned int count) { assert ((desAddr!=NULL) && (srcAddr!=NULL)); char * from = NULL; char ... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include #include using namespace std; const char * strstr1 (const char * src, const char * des) { assert ((src!=NULL)&&(des!=NULL)); int srcLen = strlen(src); int desLen = st... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include #include using namespace std; char * revStrExcludeSub (char * src, char * sub) { if ((src==NULL) || (sub==NULL)) return NULL; char * head=src, * tail=src, * pSub=sub; ... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; char * revStr (char * src, int len) { if (len <= 1) return src; *src ^= *(src+len-1); *(src+len-1) ^= *src; *src ^= *(src+len-1); return (... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include #include using namespace std; int validateInt (const char * src) { if (src == NULL) return 0; const char * p = src; while (*p>='0' && *p st; while (pA >= a) {... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; // not using string library char * rightLoop1 (char * src, int n) { if (src==NULL) return NULL; char * p = src; while (*p++); int len = p-1-sr... ÔĶÁÈ«ÎÄ
ͻ񻣼
#include #include using namespace std; // pos starting from 0 char * deleteChars1 (char * src, int pos, int len) { if ((src==NULL) || (posp) || (src+pos+len-1>p)) return NULL; memcpy (src+p... ÔĶÁÈ«ÎÄ