Skip to content

[최원준] Day08#1008

Merged
github-actions[bot] merged 1 commit into
mainfrom
WonJoonLeetcode2
Apr 2, 2025
Merged

[최원준] Day08#1008
github-actions[bot] merged 1 commit into
mainfrom
WonJoonLeetcode2

Conversation

@724thomas
Copy link
Copy Markdown
Collaborator

오늘도 수고하셨습니다

제목 형식은 "[이름] Day00" 입니다.

푸신 문제에 라벨 붙여주세요.

Copy link
Copy Markdown

Copilot AI left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Pull Request Overview

A daily submission for Day08 with implementations for three Leetcode challenges using different difficulty levels.

  • Added a (commented-out) solution for vertical binary tree traversal (hard).
  • Added a Trie-based implementation for MapSum (medium).
  • Added a zigzag traversal implementation for a 2D grid (easy).

Reviewed Changes

Copilot reviewed 3 out of 3 changed files in this pull request and generated 1 comment.

File Description
leetcode2/3hard/최원준/Q987.java Contains a commented-out vertical tree traversal solution
leetcode2/2medium/최원준/Q677.java Implements a Trie-based MapSum solution
leetcode2/1easy/최원준/Q3417.java Implements zigzag traversal for a grid

Comment thread leetcode2/3hard/최원준/Q987.java Outdated
Comment on lines 5 to 6
Copy link

Copilot AI Apr 2, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

[nitpick] Consider using more formal language in comments; for example, replace 'bfs 방식ㄱ' with a clearer explanation of the BFS approach.

Suggested change
bfs 방식ㄱ
Use the Breadth-First Search (BFS) approach to traverse the binary tree level by level.

Copilot uses AI. Check for mistakes.
@github-actions github-actions Bot merged commit 713ec25 into main Apr 2, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants