-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetCode.java
More file actions
201 lines (183 loc) · 4.52 KB
/
LeetCode.java
File metadata and controls
201 lines (183 loc) · 4.52 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
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
import java.util.*;
public class LeetCode {
public static int lengthOfLongestSubstring1(String s) {
int maxLen = 0;
int [] lastIndices = new int[256];//相当于所有字符的哈希表 lastIndices[char]即为该char所对应的值
for(int i=0;i<256;i++)
lastIndices[i] = -1;
int start = 0;
int curLen = 0;
for(int i=0;i<s.length();i++)
{
char cur = s.charAt(i);
if(lastIndices[cur]<start)
{
lastIndices[cur] = i;
curLen++;
}
else
{
start = lastIndices[cur]+1;
curLen = i-start+1;
lastIndices[cur]=i;
}
if(maxLen<curLen)
maxLen = curLen;
}
return maxLen;
}
public static int lengthOfLongestSubstring2(String s)
{
Set<Character> set = new HashSet<Character>();
int i=0;
int j=0;
int maxLen = 0;
while(j<s.length())
{
if(!set.contains(s.charAt(j)))
{
set.add(s.charAt(j++));
maxLen = Math.max(maxLen, set.size());
}
else
{
set.remove(s.charAt(i++));
}
}
return maxLen;
}
public static double findMedianSortedArrays(int[] nums1, int[] nums2) {
int N1 = nums1.length;
int N2 = nums2.length;
int[] p = new int[N1+N2];
int mid1 = 0;
int mid2 = 0;
int i=0;int j=0;
for(int k=0;k<p.length;k++ )
{
if(i>=N1)
{
p[k]=nums2[j++];
if((N1+N2)%2==0)
{
if(k==(N1+N2)/2-1)
mid1 = p[k];
if(k==(N1+N2)/2)
mid2 = p[k];
}
else
{
if(k==(N1+N2)/2)
mid1 = p[k];
}
}
else if(j>=N2)
{
p[k]=nums1[i++];
if((N1+N2)%2==0)
{
if(k==(N1+N2)/2-1)
mid1 = p[k];
if(k==(N1+N2)/2)
mid2 = p[k];
}
else
{
if(k==(N1+N2)/2)
mid1 = p[k];
}
}
else if(nums1[i]<nums2[j])
{
p[k]=nums1[i++];
if((N1+N2)%2==0)
{
if(k==(N1+N2)/2-1)
mid1 = p[k];
if(k==(N1+N2)/2)
mid2 = p[k];
}
else
{
if(k==(N1+N2)/2)
mid1 = p[k];
}
}
else
{
p[k]=nums2[j++];
if((N1+N2)%2==0)
{
if(k==(N1+N2)/2-1)
mid1 = p[k];
if(k==(N1+N2)/2)
mid2 = p[k];
}
else
{
if(k==(N1+N2)/2)
mid1 = p[k];
}
}
}
if((N1+N2)%2==0)
return (mid1+mid2)/2.0;
return mid1;
}
public static double findMedianSortedArrays1(int[] nums1, int[] nums2)
{
int m=nums1.length;
int n=nums2.length;
int[] A = nums1;
int[] B = nums2;
if(nums1.length>nums2.length)
{
A = nums2; m = nums2.length;
B = nums1; n = nums1.length;
}
int mid1=0;
int mid2=0;
int imin = 0;
int imax = m;
int half = (m+n+1)/2;
while(imin<=imax)
{
int i = (imin+imax)/2;
int j = half-i;
if(i>0&&j<n&&A[i-1]>B[j])
imax = i-1;
else if(j>0&&i<m&&B[j-1]>A[i])
imin = i+1;
else
{
if(i==0)
mid1 = B[j-1];
else if(j==0)
mid1 = A[i-1];
else
mid1=Math.max(B[j-1], A[i-1]);
if((m+n)%2==1)
{
mid2=mid1;
break;
}
if(i==m)
mid2 = B[j];
else if(j==n)
mid2 = A[i];
else
mid2 = Math.min(A[i], B[j]);
break;
}
}
return (mid1+mid2)/2.0;
}
public static void main(String args[]) {
// String s = "abcdeab";
// System.out.print(lengthOfLongestSubstring2(s));
int a[]={2,4,6,9};
int b[]={9,10,11,12,1};
double d = findMedianSortedArrays1(a,b);
System.out.println(d);
}
}