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

Sign up
Appearance settings

Commit fe7f24c

Browse files
authored
Update README.md
1 parent e81eb77 commit fe7f24c

File tree

1 file changed

+54
-0
lines changed

1 file changed

+54
-0
lines changed

‎algorithm/README.md

Lines changed: 54 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -92,6 +92,60 @@ func sort(arr []int, start, end int) {
9292

9393
## Some Problems
9494
- Longest Common Prefix
95+
```xml
96+
func longestCommonPrefix(strs []string) string {
97+
return find(strs,0,len(strs)-1)
98+
}
99+
100+
func find(strs []string, start int, end int) string{
101+
102+
if start==end{
103+
return strs[start]
104+
}
105+
106+
if(end>start){
107+
mid:=start+(end-start)/2
108+
109+
str1:=find(strs,start,mid)
110+
str2:=find(strs,mid+1,end);
111+
112+
return findPrefix(str1,str2)
113+
}
114+
return ""
115+
}
116+
117+
func findPrefix(str1 string,str2 string) string{
118+
119+
size:=0
120+
121+
if(len(str1)>len(str2)){
122+
size=len(str1)
123+
}else{
124+
size=len(str2)
125+
}
126+
127+
str:=""
128+
str1Arr := strings.Split(str1,"")
129+
str2Arr := strings.Split(str2,"")
130+
131+
for i:=0;i<size;i++{
132+
133+
if (len(str1)-1>=i && len(str2)-1>=i){
134+
if(str1Arr[i]!=str2Arr[i]){
135+
break
136+
}
137+
str=str+str1Arr[i];
138+
139+
}else{
140+
break
141+
}
142+
143+
}
144+
return str;
145+
}
146+
147+
```
148+
95149
- Median of Two Sorted Arrays
96150
- Maximum Subarray
97151
- Majority Element

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /