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

Commit5514bcd

Browse files
committed
fix103
1 parent5ca9d1c commit5514bcd

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎leetcode-103-Binary-Tree-Zigzag-Level-Order-Traversal.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -102,10 +102,10 @@ public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
102102
if (root==null)
103103
return ans;
104104
queue.offer(root);
105+
int level=0;
105106
while (!queue.isEmpty()) {
106107
int levelNum= queue.size();// 当前层元素的个数
107108
List<Integer> subList=newLinkedList<Integer>();
108-
int level=0;
109109
for (int i=0; i< levelNum; i++) {
110110
TreeNode curNode= queue.poll();
111111
if (curNode!=null) {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp