摘要: class Solution { public: string longestCommonPrefix(vector<string>& strs) { if (strs.empty()) return ""; for (int j = 0; j < strs[0].size(); ++j) { fo 阅读全文
posted @ 2017-02-06 00:06 王坤1993 阅读(120) 评论(0) 推荐(0) 编辑