Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
23 lines (22 loc) · 731 Bytes

File metadata and controls

23 lines (22 loc) · 731 Bytes
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
/*
Author: King, wangjingui@outlook.com
Date: Dec 20, 2014
Problem: Longest Common Prefix
Difficulty: Easy
Source: https://oj.leetcode.com/problems/longest-common-prefix/
Notes:
Write a function to find the longest common prefix string amongst an array of strings.
Solution: ...
*/
public class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs.length == 0) return new String("");
for(int i = 0;i < strs[0].length(); ++i){
for(int j = 1;j < strs.length; ++j){
if(i >= strs[j].length() || strs[j].charAt(i) != strs[0].charAt(i))
return strs[0].substring(0,i);
}
}
return strs[0];
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.