Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- string longestCommonPrefix(vector<string>& strs) {
- string toBeReturned = "";
- bool task = true;
- if (strs.size() <= 0)
- return toBeReturned;
- for (int i = 0; i < strs[0].size(); i++)
- {
- for (int j = 1; j < strs.size(); j++)
- {
- if (i > strs[j].size())
- {
- task = false;
- break;
- }
- if (strs[j][i] != strs[0][i])
- {
- task = false;
- break;
- }
- }
- if (task)
- {
- toBeReturned += strs[0][i];
- }
- }
- return toBeReturned;
- }
- };
Add Comment
Please, Sign In to add comment