-
Notifications
You must be signed in to change notification settings - Fork 0
/
Better String
88 lines (57 loc) · 1.58 KB
/
Better String
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
// User function Template for Java
class Solution {
public static int subseq(String s,int[] arr)
{
int n = s.length();
Arrays.fill(arr,-1);
int count = 1;
for(int i=0;i<n ;i++)
{
int indx = s.charAt(i)-'a';
if(arr[indx]==-1)
{
arr[indx] = count;
count *= 2;
}
else
{
int x = arr[indx];
arr[indx] = count;
count = (count*2)-x;
}
}
return count;
}
/*
public static int countSub(String str)
{
int n = str.length();
int[] dp = new int[n + 1];
dp[0] = 1;
int[] last = new int[256];
Arrays.fill(last, -1);
for (int i = 1; i <= n; i++)
{
dp[i] = 2 * dp[i - 1];
if (last[str.charAt(i - 1)] != -1)
{
dp[i] = dp[i] - dp[last[str.charAt(i - 1)]];
}
last[str.charAt(i - 1)] = (i - 1);
}
return dp[n];
}
*/
public static String betterString(String str1, String str2)
{
// Code here
int[] arr = new int[26];
int m = subseq(str1, arr);
int n = subseq(str2, arr);
if (m <n)
{
return str2;
}
return str1;
}
}