FightForProgrammer的专栏

顺序容器

关联容器

状态(State)模式一、问题的提出

const使用及问题总结

LeetCode Gas StationGas Station  There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it cost

LeetCode Longest Common PrefixWrite a function to find the longest common prefix string amongst an array of strings.很傻逼的逐个比较法。。string longestCommonPrefix(vector &strs) { string r

LeetCode Min StackDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of