-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcomum.cpp
More file actions
50 lines (40 loc) · 1.15 KB
/
comum.cpp
File metadata and controls
50 lines (40 loc) · 1.15 KB
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
#include<bits/stdc++.h>
using namespace std;
/*
string commonPrefixUtil(string str1, string str2){
string result;
int n1 = str1.length(), n2 = str2.length();
for (int i=0, j=0; i<=n1-1&&j<=n2-1; i++,j++) {
if (str1[i] != str2[j])
break;
result.push_back(str1[i]);
}
return (result);
}
string commonPrefix(string arr[], int low, int high) {
if (low == high)
return (arr[low]);
if (high > low){
int mid = low + (high - low) / 2;
string str1 = commonPrefix(arr, low, mid);
string str2 = commonPrefix(arr, mid+1, high);
return (commonPrefixUtil(str1, str2));
}
}
*/
int main(){
string arr[] = {"geeksforgeeks", "geeks", "geek", "geezer"};
int n = sizeof (arr) / sizeof (arr[0]);
cout << sizeof (arr) << "\n";
cout << sizeof (arr[0])<< "\n";
cout << sizeof (arr[1]);
//cout << n;
/*string ans = commonPrefix(arr, 0, n-1);
if (ans.length())
cout << "The longest common prefix is "
<< ans;
else
cout << "There is no common prefix";
*/
return (0);
}