摘要：
class Solution {public: string longestCommonPrefix(vector &strs) { int size = strs.size(); if(size==0) return ""; ... 阅读全文
摘要：
class Solution {public: int atoi(const char *str) { bool negative = false; while(*str==' ')str++ ; if(*str=='-') ... 阅读全文