From 17ab781026e2fb48eef8d1c4598a8b07e93b460f Mon Sep 17 00:00:00 2001 From: sora0319 Date: Sat, 16 Aug 2025 20:35:05 +0900 Subject: [PATCH 1/6] solve maximum depth of binary tree --- maximum-depth-of-binary-tree/sora0319.java | 1 + 1 file changed, 1 insertion(+) diff --git a/maximum-depth-of-binary-tree/sora0319.java b/maximum-depth-of-binary-tree/sora0319.java index ea1419c8b..31c4041c1 100644 --- a/maximum-depth-of-binary-tree/sora0319.java +++ b/maximum-depth-of-binary-tree/sora0319.java @@ -8,3 +8,4 @@ public int maxDepth(TreeNode root) { } } + From f0fe90e69a87471a4dabf470ce058d796e2d72e1 Mon Sep 17 00:00:00 2001 From: sora0319 Date: Sat, 16 Aug 2025 20:35:15 +0900 Subject: [PATCH 2/6] solve merge two sorted lists --- merge-two-sorted-lists/sora0319.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/merge-two-sorted-lists/sora0319.java b/merge-two-sorted-lists/sora0319.java index 7366c2042..2d942abba 100644 --- a/merge-two-sorted-lists/sora0319.java +++ b/merge-two-sorted-lists/sora0319.java @@ -1,5 +1,4 @@ /** - * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; @@ -38,3 +37,4 @@ public ListNode mergeTwoLists(ListNode list1, ListNode list2) { } } + From 0f5561caba1507624029c1db27d1432728a3d781 Mon Sep 17 00:00:00 2001 From: sora0319 Date: Sat, 16 Aug 2025 20:35:28 +0900 Subject: [PATCH 3/6] solve ifnd minimum in rotated sorted array --- find-minimum-in-rotated-sorted-array/sora0319.java | 1 + 1 file changed, 1 insertion(+) diff --git a/find-minimum-in-rotated-sorted-array/sora0319.java b/find-minimum-in-rotated-sorted-array/sora0319.java index ce4999cec..1eadf09b8 100644 --- a/find-minimum-in-rotated-sorted-array/sora0319.java +++ b/find-minimum-in-rotated-sorted-array/sora0319.java @@ -19,3 +19,4 @@ public int findMin(int[] nums) { } } + From c1a1072de3b01a3b8e307ec947d6e979ca8b9321 Mon Sep 17 00:00:00 2001 From: sora0319 Date: Sat, 16 Aug 2025 20:35:36 +0900 Subject: [PATCH 4/6] solve coin change --- coin-change/sora0319.java | 1 + 1 file changed, 1 insertion(+) diff --git a/coin-change/sora0319.java b/coin-change/sora0319.java index e161a8487..2a5bb820e 100644 --- a/coin-change/sora0319.java +++ b/coin-change/sora0319.java @@ -19,3 +19,4 @@ public int coinChange(int[] coins, int amount) { } + From 157b4d54e9c8345a441c6f2e4704571674f6c5d7 Mon Sep 17 00:00:00 2001 From: sora0319 Date: Sat, 16 Aug 2025 20:35:46 +0900 Subject: [PATCH 5/6] solve word search --- word-search/sora0319.java | 1 + 1 file changed, 1 insertion(+) diff --git a/word-search/sora0319.java b/word-search/sora0319.java index 2c3a62aa7..9c0455706 100644 --- a/word-search/sora0319.java +++ b/word-search/sora0319.java @@ -40,3 +40,4 @@ public boolean checkingWord(char[][] board, String word, boolean[][] visited, in } } + From 3a901db9eb5869110f6c9711b83170b531a2fe32 Mon Sep 17 00:00:00 2001 From: sora0319 Date: Sat, 16 Aug 2025 20:37:17 +0900 Subject: [PATCH 6/6] solve 2 weeks problems --- 3sum/sora0319.java | 1 + product-of-array-except-self/sora0319.java | 1 + validate-binary-search-tree/sora0319.java | 1 + 3 files changed, 3 insertions(+) diff --git a/3sum/sora0319.java b/3sum/sora0319.java index 2685edef3..67aa23b14 100644 --- a/3sum/sora0319.java +++ b/3sum/sora0319.java @@ -35,3 +35,4 @@ public List> threeSum(int[] nums) { } } + diff --git a/product-of-array-except-self/sora0319.java b/product-of-array-except-self/sora0319.java index c094dd3d4..68cc0b773 100644 --- a/product-of-array-except-self/sora0319.java +++ b/product-of-array-except-self/sora0319.java @@ -19,3 +19,4 @@ public int[] productExceptSelf(int[] nums) { } } + diff --git a/validate-binary-search-tree/sora0319.java b/validate-binary-search-tree/sora0319.java index af9aa9104..b75985dbb 100644 --- a/validate-binary-search-tree/sora0319.java +++ b/validate-binary-search-tree/sora0319.java @@ -11,3 +11,4 @@ public boolean isvalid(TreeNode root,long min,long max) } } +