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 65c97dd

Browse files
committed
feat: add question
1 parent d1d4370 commit 65c97dd

File tree

7 files changed

+74
-13
lines changed

7 files changed

+74
-13
lines changed

‎00-code(源代码)/src/com/hi/dhl/algorithms/leetcode/_349/java/Solution.java

Lines changed: 29 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
11
package com.hi.dhl.algorithms.leetcode._349.java;
22

3+
import java.util.Arrays;
34
import java.util.HashSet;
45
import java.util.Set;
56

@@ -33,4 +34,31 @@ public int[] intersection(int[] nums1, int[] nums2) {
3334
}
3435
return result;
3536
}
36-
}
37+
38+
public int[] intersection2(int[] nums1, int[] nums2) {
39+
Arrays.sort(nums1);
40+
Arrays.sort(nums2);
41+
int index = 0;
42+
int i = 0;
43+
int j = 0;
44+
int alen = nums1.length;
45+
int blen = nums2.length;
46+
int[] data = new int[alen + blen];
47+
while (i < alen && j < blen) {
48+
int n1 = nums1[i];
49+
int n2 = nums2[j];
50+
if (n1 == n2) {
51+
if (index == 0 || data[index - 1] != n1) {
52+
data[index++] = n1;
53+
}
54+
i++;
55+
j++;
56+
} else if (n1 < n2) {
57+
i++;
58+
} else {
59+
j++;
60+
}
61+
}
62+
return Arrays.copyOfRange(data, 0, index);
63+
}
64+
}

‎00-code(源代码)/src/com/hi/dhl/algorithms/offer/_28/kotlin/Solution.kt

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -23,6 +23,7 @@ class Solution {
2323
fun isSame(a: TreeNode?, b: TreeNode?): Boolean {
2424
if (a == null && b == null) return true
2525
if (a == null || b == null || a.`val` != b.`val`) return false
26+
2627
return return isSame(a.left, b.left) && isSame(a.right, b.right)
2728
}
2829

‎leetcode/binary-tree/11-same-tree.md

Lines changed: 3 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -179,18 +179,15 @@ class Solution {
179179
```
180180
class Solution {
181181
public boolean isSameTree(TreeNode p, TreeNode q) {
182-
if(p == null && q == null){
182+
if(p == null && q == null){
183183
return true;
184184
}
185185
186-
if(p == null || q == null) {
186+
if(p == null || q == null || p.val != q.val){
187187
return false;
188188
}
189189
190-
if (p.val == q.val) {
191-
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
192-
}
193-
return false;
190+
return isSameTree(p.left,q.left) && isSameTree(p.right,q.right);
194191
}
195192
}
196193
```

‎leetcode/hash/01-intersection-of-two-arrays.md

Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -106,3 +106,37 @@ class Solution {
106106

107107
<!-- tabs:end -->
108108

109+
### 双指针
110+
111+
```
112+
class Solution {
113+
public int[] intersection(int[] nums1, int[] nums2) {
114+
Arrays.sort(nums1);
115+
Arrays.sort(nums2);
116+
int index = 0;
117+
int i = 0;
118+
int j = 0;
119+
int alen = nums1.length;
120+
int blen = nums2.length;
121+
int[] data = new int[alen + blen];
122+
while (i < alen && j < blen) {
123+
int n1 = nums1[i];
124+
int n2 = nums2[j];
125+
if (n1 == n2) {
126+
if (index == 0 || data[index - 1] != n1) {
127+
data[index++] = n1;
128+
}
129+
i++;
130+
j++;
131+
} else if (n1 < n2) {
132+
i++;
133+
} else {
134+
j++;
135+
}
136+
}
137+
return Arrays.copyOfRange(data, 0, index);
138+
}
139+
}
140+
141+
```
142+

‎leetcode/index.html

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -83,7 +83,8 @@
8383

8484
hook.beforeEach(function(content) {
8585
var url1 ='https://github.com/hi-dhl/Leetcode-Solutions-with-Java-And-Kotlin/tree/master/offer/' + vm.route.file;
86-
var editHtml1 = '❤️ 如果发现错误,或者有更好的方案,期待你来一起完善?[前往 Github 编辑此页](' + url1 +')!\n'
86+
// var editHtml1 = '❤️ 如果发现错误,或者有更好的方案,期待你来一起完善?[前往 Github 编辑此页](' + url1 +')!\n'
87+
var editHtml1 = '❤️ 公众号 : ByteCode \n'
8788
var url2 ='https://github.com/hi-dhl/Leetcode-Solutions-with-Java-And-Kotlin/tree/master/00-code(%E6%BA%90%E4%BB%A3%E7%A0%81)/src/com/hi/dhl/algorithms';
8889
var editHtml2 = ' <br/>👉 点击这里 [前往 Github 查看](' + url2 +') 文章源码\n'
8990
var head = ">"+editHtml1 + editHtml2

‎offer/algorithm/21-diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.md

Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -260,8 +260,8 @@ public int[] exchange(int[] nums) {
260260
for (int i = 0; i < nums.length; i++) {
261261
if (nums[i] % 2 != 0) continue;
262262
263-
int temp = 0;
264-
int evenIndex = -1;
263+
int temp = nums[i];
264+
int evenIndex = i;
265265
266266
for (int j = i + 1; j < nums.length; j++) {
267267
if (nums[j] % 2 != 0) {
@@ -275,8 +275,7 @@ public int[] exchange(int[] nums) {
275275
nums[k] = nums[k - 1];
276276
}
277277
278-
if (temp != 0)
279-
nums[i] = temp;
278+
nums[i] = temp;
280279
}
281280
return nums;
282281
}

‎offer/index.html

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -87,7 +87,8 @@
8787

8888
hook.beforeEach(function(content) {
8989
var url1 ='https://github.com/hi-dhl/Leetcode-Solutions-with-Java-And-Kotlin/tree/master/offer/' + vm.route.file;
90-
var editHtml1 = '❤️ 如果发现错误,或者有更好的方案,期待你来一起完善?[前往 Github 编辑此页](' + url1 +')!\n'
90+
// var editHtml1 = '❤️ 如果发现错误,或者有更好的方案,期待你来一起完善?[前往 Github 编辑此页](' + url1 +')!\n'
91+
var editHtml1 = '❤️ 公众号 : ByteCode \n'
9192
var url2 ='https://github.com/hi-dhl/Leetcode-Solutions-with-Java-And-Kotlin/tree/master/00-code(%E6%BA%90%E4%BB%A3%E7%A0%81)/src/com/hi/dhl/algorithms';
9293
var editHtml2 = ' <br/>👉 点击这里 [前往 Github 查看](' + url2 +') 文章源码\n'
9394
var head = ">"+editHtml1 + editHtml2

0 commit comments

Comments
(0)

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