FilesExpand file tree

 master

/

Solution14.hpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (43 loc) · 1.33 KB

 master

/

Solution14.hpp

Top

File metadata and controls

• Code
• Blame

52 lines (43 loc) · 1.33 KB

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

47

48

49

50

51

52

//

// Solution14.hpp

// Algorithm

//

// Created by Pancf on 2020/1/5.

// Copyright © 2020 Pancf. All rights reserved.

//

#ifndef Solution14_hpp

#define Solution14_hpp

#include <stdio.h>

#include <vector>

#include <string>

using std::vector;

using std::string;

class Solution14 {

/**

Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string "".

Example 1:

Input: ["flower","flow","flight"]

Output: "fl"

Example 2:

Input: ["dog","racecar","car"]

Output: ""

Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

================================================================================================

Accept details:

Runtime: 8 ms, faster than 53.33% of C++ online submissions for Longest Common Prefix.

Memory Usage: 8.9 MB, less than 50.00% of C++ online submissions for Longest Common Prefix.

*/

public:

string longestCommonPrefix(vector<string>& strs);

static void test() {

vector<string> v1{ "flower", "flow", "flight" };

vector<string> v2{ "dog", "raceer", "car" };

Solution14 s = Solution14();

printf("%s ", s.longestCommonPrefix(v1).c_str());

printf("%s ", s.longestCommonPrefix(v2).c_str());

}

};

#endif /* Solution14_hpp */