iframe-proxy | Sunbelt Computer Software

40 lines (37 loc) · 735 Bytes

 * @brief Longest Common Prefix
 * cpselvis(cpselvis@gmail.com)
 * August 8th, 2016
#include<iostream>
#include<string>
#include<vector>
using namespace std;
class Solution {
  string longestCommonPrefix(vector<string>& strs) {
    if (strs.empty())
      return "";
    for (int i = 0; i < strs[0].size(); i ++)
      for (int j = 0; j < strs.size(); j ++)
	if (strs[j].size() < i + 1 || strs[j][i] != strs[0][i])
	  return strs[0].substr(0, i);
    return strs[0];
int main(int argc, char **argv)
  Solution s;
  string arr[] = {"abcde", "abc", "abde", "abedc"};
  vector<string> strs(arr + 0, arr + 4);
  cout << s.longestCommonPrefix(strs) << endl;

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

solution014.cpp

Latest commit

History

solution014.cpp

File metadata and controls