leetcode推前leetcode C++中的leetcode

重要：15, 74, 105, 200, 236, 39 & 40 & 46, 43, 55, 81, 90, 96, 131

重做：31、33

binary_search变种：旋转，重复

cp：

// string strNew = str + 'c'

string strNew = str + \"car\"

string strNew = str + (char)56

bool eq = str1 == str2

bool eq = str == \"car\"

// vector

visited(numCourses, false);

v.size()

v.push_back(val)

v.pop_back()

val = v.front()

val = v.back()

// set

s.insert(val)

s.erase(val)

s.find(val) != s.end() // s contains val

// queue

q.front()

q.back()

q