Crawler Log Folder - minimum number of operations needed to go back to the main folder after the change folder operations.
Problem The Leetcode file system keeps a log each time some user performs a…
September 13, 2019
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: ""
Note: All given inputs are in lowercase letters a-z.
Lets look at a simple solution, where we will look in entire strings for the match.
public String longestCommonPrefix(String[] strs) {
int strsLen = strs.length;
if (strsLen == 0) {
return "";
}
int l = strs[0].length();
StringBuffer sb = new StringBuffer();
for (int i=0; i<l; i++) {
char ch = strs[0].charAt(i);
boolean matched = true;
for (int j=1; j<strsLen; j++) {
if (i >= strs[j].length() || ch != strs[j].charAt(i)) {
matched = false;
break;
}
}
if (!matched) {
break;
}
sb.append(ch);
}
return sb.toString();
}
We can use divide and conquer, and then merge the result. Since, common of two strings will be eligible to match from other strings.
public String longestCommonPrefix(String[] strs) {
if (strs.length == 0) return "";
return helper(strs, 0, strs.length-1);
}
private String findRes(String l, String r) {
int len = Math.min(l.length(), r.length());
int i=0;
for (; i<len; i++) {
if (l.charAt(i) != r.charAt(i)) {
break;
}
}
return l.substring(0, i);
}
private String helper(String[] strs, int l, int r) {
if (l == r) return strs[l];
int m = (l+r)/2;
String left = helper(strs, l, m);
String right = helper(strs, m+1, r);
return findRes(left, right);
}
Problem The Leetcode file system keeps a log each time some user performs a…
Problem Statement Given a linked list, remove the n-th node from the end of list…
Problem Statement You are given a rows x cols matrix grid. Initially, you are…
Problem Statement Given a string s, return the maximum number of unique…
** Inversion There is an array(a) and two indexes i and j. Inversion is the…
Problem Statement You are given an n x n 2D matrix representing an image, rotate…
Introduction This post has the complete code to send email through smtp server…
Introduction In a normal email sending code from python, I’m getting following…
Introduction In one of my app, I was using to talk to . I have used some event…
Introduction So you have a Django project, and want to run it using docker image…
Introduction It is very important to introduce few process so that your code and…
Introduction In this post, we will see a sample Jenkin Pipeline Groovy script…