FilesExpand file tree

 master

/

LongestCommonPrefix.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

34 lines (31 loc) · 1.01 KB

 master

/

LongestCommonPrefix.java

Top

File metadata and controls

• Code
• Blame

34 lines (31 loc) · 1.01 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

package string;

/**

* Created by gouthamvidyapradhan on 12/04/2018.

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

*

* Solution: O(N x M) where N is the length of the given array and M is the max_length of a string.

*/

public class LongestCommonPrefix {

/**

* Main method

* @param args

*/

public static void main(String[] args) throws Exception{

String[] A = {"abc", "a", "adkd"};

System.out.println(new LongestCommonPrefix().longestCommonPrefix(A));

}

public String longestCommonPrefix(String[] strs) {

if(strs.length == 0) return "";

String result = strs[0];

for(int i = 1; i < strs.length; i ++){

String s = strs[i];

for(int j = 0; j < result.length(); j++){

if(j >= s.length() || result.charAt(j) != s.charAt(j)) {

result = result.substring(0, j);

break;

}

}

}

return result;

}

}