문자열의 배열에서 가장 긴 공통의 prefix를 찾아내는 문제입니다.
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string answer = strs[0];
for(int i=0;i<strs[0].size();i++)
{
for(int j=1;j<strs.size();j++)
{
if(strs[0][i] != strs[j][i])
{
answer = strs[0].substr(0,i);
return answer;
}
}
}
return answer;
}
};
'알고리즘 > LeetCode' 카테고리의 다른 글
[LeetCode] 4. Median of Two Sorted Arrays (Hard) (0) | 2022.04.28 |
---|---|
[LeetCode] 7. Reverse Integer (Medium) (0) | 2022.04.28 |
[LeetCode] 6. Zigzag Conversion (Medium) (0) | 2022.04.28 |
[LeetCode] 9. Palindrome Number (Easy) (0) | 2022.04.27 |
[LeetCode] 3. Longest Substring Without Repeating Characters (Medium) (0) | 2022.04.27 |