FilesExpand file tree

 master

/

14.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

46 lines (39 loc) · 782 Bytes

 master

/

14.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

46 lines (39 loc) · 782 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

#include "stdafx.h"

#include <vector>

#include <stack>

#include <algorithm>

#include <iostream>

#include <set>

#include <string>

using namespace std;

/*

编写一个函数来查找字符串数组中的最长公共前缀。

如果不存在公共前缀，返回空字符串 ""。

示例 1:

输入: ["flower","flow","flight"]

输出: "fl"

示例 2:

输入: ["dog","racecar","car"]

输出: ""

解释: 输入不存在公共前缀。

说明:

所有输入只包含小写字母 a-z 。

*/

class Solution {

public:

string longestCommonPrefix(vector<string>& strs) {

string ret = "";

if (strs.size() == 0)

return ret;

else if (strs.size() == 1)

return strs[0];

for (int i = 0; i < strs[0].size(); ++i) {

for (int j = 0; j < strs.size(); ++j) {

if (strs[0][i] != strs[j][i])

return ret;

}

ret += strs[0][i];

}

return ret;

}

};