Movatterモバイル変換

[0]ホーム
URL:

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

Commit5919f5e

Browse files
add a solution for 404
1 parent82a298e commit5919f5e

File tree

2 files changed

+77
-0
lines changed

2 files changed

+77
-0
lines changed

‎src/main/java/com/fishercoder/solutions/_404.java

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,9 @@
22

33
importcom.fishercoder.common.classes.TreeNode;
44

5+
importjava.util.LinkedList;
6+
importjava.util.Queue;
7+
58
publicclass_404 {
69
publicstaticclassSolution1 {
710
publicintsumOfLeftLeaves(TreeNoderoot) {
@@ -51,4 +54,33 @@ public int sumOfLeftLeaves(TreeNode root) {
5154
returnsum;
5255
}
5356
}
57+
58+
publicstaticclassSolution3 {
59+
/**
60+
* My completely original solution on 11/4/2021.
61+
*/
62+
publicintsumOfLeftLeaves(TreeNoderoot) {
63+
Queue<TreeNode>queue =newLinkedList<>();
64+
queue.offer(root);
65+
intlevel =0;
66+
intsum =0;
67+
while (!queue.isEmpty()) {
68+
intsize =queue.size();
69+
for (inti =0;i <size;i++) {
70+
TreeNodecurr =queue.poll();
71+
if (curr ==null) {
72+
continue;
73+
}
74+
if (level >0 &&curr.left ==null &&curr.right ==null &&i %2 !=1) {
75+
sum +=curr.val;
76+
}
77+
queue.offer(curr.left);
78+
queue.offer(curr.right);
79+
80+
}
81+
level++;
82+
}
83+
returnsum;
84+
}
85+
}
5486
}
Lines changed: 45 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,45 @@
1+
packagecom.fishercoder;
2+
3+
importcom.fishercoder.common.classes.TreeNode;
4+
importcom.fishercoder.common.utils.TreeUtils;
5+
importcom.fishercoder.solutions._404;
6+
importorg.junit.BeforeClass;
7+
importorg.junit.Test;
8+
9+
importjava.util.Arrays;
10+
11+
importstaticjunit.framework.TestCase.assertEquals;
12+
13+
publicclass_404Test {
14+
privatestatic_404.Solution1solution1;
15+
privatestatic_404.Solution2solution2;
16+
privatestatic_404.Solution3solution3;
17+
privatestaticTreeNoderoot;
18+
privatestaticintexpected;
19+
20+
@BeforeClass
21+
publicstaticvoidsetup() {
22+
solution1 =new_404.Solution1();
23+
solution2 =new_404.Solution2();
24+
solution3 =new_404.Solution3();
25+
}
26+
27+
@Test
28+
publicvoidtest1() {
29+
root =TreeUtils.constructBinaryTree(Arrays.asList(3,9,20,null,null,15,7));
30+
expected =24;
31+
assertEquals(expected,solution1.sumOfLeftLeaves(root));
32+
assertEquals(expected,solution2.sumOfLeftLeaves(root));
33+
assertEquals(expected,solution3.sumOfLeftLeaves(root));
34+
}
35+
36+
@Test
37+
publicvoidtest2() {
38+
root =TreeUtils.constructBinaryTree(Arrays.asList(1,null,2));
39+
expected =0;
40+
assertEquals(expected,solution1.sumOfLeftLeaves(root));
41+
assertEquals(expected,solution2.sumOfLeftLeaves(root));
42+
assertEquals(expected,solution3.sumOfLeftLeaves(root));
43+
}
44+
45+
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp