leetcode-14-longest common prefix

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        string result="";
        if(strs.empty())
            return result;
        int len = strs.size();
        int shortstr=INT_MAX;
        char temp;
        for(int i=0;i<len;i++)
            if(strs[i].size() < shortstr)
                shortstr = strs[i].size();
        for(int j = 0;j<shortstr;j++){
            temp = strs[0][j];
            for(int k = 0;k<len;k++){
                if(strs[k][j]!=temp){
                    return result;
                }
            }
            result.push_back(temp);
        }
        return result;
    }
};