class Solution {public: string longestCommonPrefix(vector&strs) { int size = strs.size(); if(size==0) return ""; if(size==1) return strs[0]; string result = ""; int i,j; for(j=0;;j++) { for(i=0;i
本文共 349 字,大约阅读时间需要 1 分钟。
class Solution {public: string longestCommonPrefix(vector&strs) { int size = strs.size(); if(size==0) return ""; if(size==1) return strs[0]; string result = ""; int i,j; for(j=0;;j++) { for(i=0;i
转载于:https://my.oschina.net/vintnee/blog/640514