forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrivkode.java
More file actions
75 lines (59 loc) ยท 1.69 KB
/
rivkode.java
File metadata and controls
75 lines (59 loc) ยท 1.69 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
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
/*
1. ๋ฌธ์ ์ดํด
๋ฃจํธ๋
ธ๋๋ฅผ ์
๋ ฅ๋ฐ์์ ๋ชจ๋ ๋
ธ๋๋ค์ด ์๋ก ๋์ผํ์ง ์ฒดํฌ
2. ์๊ณ ๋ฆฌ์ฆ
bfs ์ฌ์ฉ ?
queue ์ฌ์ฉํด์ ๊ฐ ๋ ๋ฒจ๋ณ๋ก ๋์ผํ์ง ์ฒดํฌ ?
3. ์์ธ
4. ๊ตฌํ
๊ฐ ํธ๋ฆฌ๋ณ๋ก queue ๋ฅผ ์์ฑ
์ต์ด ๋ฃจํธ ๋
ธ๋ ๊ฐ ํ๋ณ๋ก ๋ฃ๊ธฐ
while loop ์์
1.
*/
import java.util.*;
class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if (p == null && q == null) {
return true;
}
if (p == null || q == null) {
return false; // ๋์ค ํ๋๋ง false ์ด๋ฏ๋ก ์๋ก ๋ค๋ฆ
}
if (p.val != q.val) {
return false; // ์๋ก ๋์ผํ ํํ์ผ๋ ๊ฐ์ด ๋ค๋ฅด๋ฉด ๋ค๋ฅด๋ฏ๋ก
}
return this.isSameTree(p.left, q.left) && this.isSameTree(p.right, q.right); // ์ฌ๊ท ํธ์ถ
// Queue<Integer> pQueue = new LinkedList<>();
// Queue<Integer> qQueue = new LinkedList<>();
// pQueue.offer(p);
// qQueue.offer(q);
// while (pQueue.size() != 0 || qQueue.size() != 0) {
// TreeNode pNode = pQueue.poll();
// TreeNode qNode = qQueue.poll();
// pNode.left;
// }
}
public boolean checkLeaf(TreeNode a, TreeNode b) {
if (a == b) {
return true;
} else {
return false;
}
}
}