From 37cada7510c5a66ec1e1f134dec8da5dd97cb2de Mon Sep 17 00:00:00 2001 From: printjin Date: Sun, 8 Jun 2025 14:44:56 +0900 Subject: [PATCH 1/6] Solve : Missing Number --- missing-number/printjin-gmailcom.py | 6 ++++++ 1 file changed, 6 insertions(+) create mode 100644 missing-number/printjin-gmailcom.py diff --git a/missing-number/printjin-gmailcom.py b/missing-number/printjin-gmailcom.py new file mode 100644 index 000000000..9128673d7 --- /dev/null +++ b/missing-number/printjin-gmailcom.py @@ -0,0 +1,6 @@ +class Solution: + def missingNumber(self, nums): + n = len(nums) + expected_sum = n * (n + 1) // 2 + actual_sum = sum(nums) + return expected_sum - actual_sum From faeaa2b4b7b2521c5681a60b2170688c26d4b441 Mon Sep 17 00:00:00 2001 From: printjin Date: Sun, 8 Jun 2025 14:49:43 +0900 Subject: [PATCH 2/6] Solve : Reorder List --- reorder-list/printjin-gmailcom.py | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 reorder-list/printjin-gmailcom.py diff --git a/reorder-list/printjin-gmailcom.py b/reorder-list/printjin-gmailcom.py new file mode 100644 index 000000000..891fdfda1 --- /dev/null +++ b/reorder-list/printjin-gmailcom.py @@ -0,0 +1,18 @@ +class Solution: + def reorderList(self, head): + if not head: + return + nodes = [] + current = head + while current: + nodes.append(current) + current = current.next + i, j = 0, len(nodes) - 1 + while i < j: + nodes[i].next = nodes[j] + i += 1 + if i == j: + break + nodes[j].next = nodes[i] + j -= 1 + nodes[i].next = None From 60f506bee4a274f5b1e08e6efdd62c962c1e42ea Mon Sep 17 00:00:00 2001 From: printjin Date: Sun, 8 Jun 2025 14:51:22 +0900 Subject: [PATCH 3/6] Solve : Graph Valid Tree --- graph-valid-tree/printjin-gmailcom.py | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 graph-valid-tree/printjin-gmailcom.py diff --git a/graph-valid-tree/printjin-gmailcom.py b/graph-valid-tree/printjin-gmailcom.py new file mode 100644 index 000000000..8ae9d221a --- /dev/null +++ b/graph-valid-tree/printjin-gmailcom.py @@ -0,0 +1,16 @@ +class Solution: + def valid_tree(self, n, edges): + if len(edges) != n - 1: + return False + parent = [i for i in range(n)] + def find(x): + while parent[x] != x: + parent[x] = parent[parent[x]] + x = parent[x] + return x + for u, v in edges: + pu, pv = find(u), find(v) + if pu == pv: + return False + parent[pu] = pv + return True From 6f38c768cb345da2040e93f74545940d921784de Mon Sep 17 00:00:00 2001 From: printjin Date: Sun, 8 Jun 2025 14:52:19 +0900 Subject: [PATCH 4/6] Solve : Merge Intervals --- merge-intervals/printjin-gamilcom.py | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 merge-intervals/printjin-gamilcom.py diff --git a/merge-intervals/printjin-gamilcom.py b/merge-intervals/printjin-gamilcom.py new file mode 100644 index 000000000..be5d8b9c5 --- /dev/null +++ b/merge-intervals/printjin-gamilcom.py @@ -0,0 +1,10 @@ +class Solution: + def merge(self, intervals): + intervals.sort(key=lambda x: x[0]) + merged = [] + for interval in intervals: + if not merged or merged[-1][1] < interval[0]: + merged.append(interval) + else: + merged[-1][1] = max(merged[-1][1], interval[1]) + return merged From c34b6490bee4468e500b020371d9c452617b962d Mon Sep 17 00:00:00 2001 From: printjin Date: Sun, 8 Jun 2025 14:53:27 +0900 Subject: [PATCH 5/6] Solve : Binary Tree Maximum Path Sum --- binary-tree-maximum-path-sum/printjin-gmailcom.py | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 binary-tree-maximum-path-sum/printjin-gmailcom.py diff --git a/binary-tree-maximum-path-sum/printjin-gmailcom.py b/binary-tree-maximum-path-sum/printjin-gmailcom.py new file mode 100644 index 000000000..7562574bc --- /dev/null +++ b/binary-tree-maximum-path-sum/printjin-gmailcom.py @@ -0,0 +1,12 @@ +class Solution: + def maxPathSum(self, root): + self.max_sum = float('-inf') + def dfs(node): + if not node: + return 0 + left = max(dfs(node.left), 0) + right = max(dfs(node.right), 0) + self.max_sum = max(self.max_sum, node.val + left + right) + return node.val + max(left, right) + dfs(root) + return self.max_sum From b93eb382cf291782ee762a24547bfe57a2887867 Mon Sep 17 00:00:00 2001 From: printjin Date: Sun, 8 Jun 2025 14:54:54 +0900 Subject: [PATCH 6/6] =?UTF-8?q?Error=20:=20=ED=8C=8C=EC=9D=BC=EB=AA=85=20?= =?UTF-8?q?=EC=97=90=EB=9F=AC?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- merge-intervals/{printjin-gamilcom.py => printjin-gmailcom.py} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename merge-intervals/{printjin-gamilcom.py => printjin-gmailcom.py} (100%) diff --git a/merge-intervals/printjin-gamilcom.py b/merge-intervals/printjin-gmailcom.py similarity index 100% rename from merge-intervals/printjin-gamilcom.py rename to merge-intervals/printjin-gmailcom.py