代碼黑魔法-叉姐(郭曉旭) 競(jìng)賽代碼講義
So ope int result =0 int result 1 std:: cout < result < std:: endl //=>1 std: cout < result < std:: endl 4口4問(wèn)44意 a better scope do t if (failedi break puts ("Yes"); I while (false) 4口4問(wèn)44意 Placement new // slow new Node o / fast Node nodes [MAX NODE] Node* newNode nodes; new (newNode++ Node o 4口4問(wèn)44意 Stream design struct Info i int value; Info* update (int delta)t value + delta; return this; (new Info()->update(1)->update(2)->update(3); 4口4問(wèn)44意 std:: lower bound #define ALL (v)(v)begin,(v). end o std: vector <int> list; std:: vector <int> values(list) std:: sort(ALL (values)) std: unique (all (values), values. end() for (int &item list)t item std:: lower bound (AlL (values), item)- values. be 4口4問(wèn)44意 std: set <int> set; // bad std: lowerbound(set begin(, set end(, value) / good set lower bound (value) 4口4問(wèn)44意 auto s七d:: ector<int>1ist auto iterator std: lower_bound (list. begin, list. endO, item 4口4問(wèn)44意 std: vector <int> list; #define For(i, v for (_typeof ((v)begin()i=(v)begin; (v). endo FOR (item, list) t std:: cout < *item < std: endl. for (auto &item list)i std:: cout < item < std:: endl 4口4問(wèn)44意