[LeetCode/easy] Longest Common Prefix

 

https://leetcode.com/problems/longest-common-prefix/submissions/

Longest Common Prefix - LeetCode

 

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

string longestCommonPrefix(vector<string> strs){
    string answer = "";
    for(int i=0; i<strs[0].size(); i++){
        for(int j=1; j<strs.size(); j++){
            if(strs[0][i] != strs[j][i]) return answer;
        }
        answer += strs[0][i];
    }
    return answer;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cout << longestCommonPrefix({"flower", "flow", "flight"}) << '\n';
    cout << longestCommonPrefix({"dog","racecar","car"}) << '\n';
}

 

맨 첫 번째 원소를 사용해서 다른 원소들을 체크하면서 만약 하나라도 일치하지 않는다면 바로 common prefix를 할당하고 있는 answer를 출력해준다.