摘要:
char* longestCommonPrefix(char** strs, int strsSize) { if(strsSize == 0)return ""; for(int i = 0 ; strs[0][i] ; i ++){ for(int j = 1 ; j < strsSize ; 阅读全文
摘要:
class Solution {private: static int a[200]; static map<int,string> mp; static vector<int> vec_list; void init (){ if(a['I'])return ; a[0] = 0; a['I'] 阅读全文