From 1578c8c9f3965afbde5d46fece7c3bbe121b5448 Mon Sep 17 00:00:00 2001 From: Chan Date: Sun, 13 Jul 2025 17:23:51 +0900 Subject: [PATCH 1/3] pg_68936 --- src/week03/Chanjong/pg_68936.java | 38 +++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 src/week03/Chanjong/pg_68936.java diff --git a/src/week03/Chanjong/pg_68936.java b/src/week03/Chanjong/pg_68936.java new file mode 100644 index 0000000..fd6a9d9 --- /dev/null +++ b/src/week03/Chanjong/pg_68936.java @@ -0,0 +1,38 @@ +class Solution { + public int[] solution(int[][] arr) { + return quadtree(arr, 0, 0, arr[0].length); + } + + public int[] quadtree(int[][] arr, int x, int y, int len){ + boolean isSame = true; + + //x, y는 배열의 시작 인덱스 + for(int i=x; i Date: Sun, 13 Jul 2025 18:03:06 +0900 Subject: [PATCH 2/3] =?UTF-8?q?solution=EB=AA=85=20=EB=B3=80=EA=B2=BD?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/week03/Chanjong/pg_68936.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/week03/Chanjong/pg_68936.java b/src/week03/Chanjong/pg_68936.java index fd6a9d9..29ac974 100644 --- a/src/week03/Chanjong/pg_68936.java +++ b/src/week03/Chanjong/pg_68936.java @@ -1,5 +1,5 @@ class Solution { - public int[] solution(int[][] arr) { + public int[] solutionWeek3C(int[][] arr) { return quadtree(arr, 0, 0, arr[0].length); } From 5ddbda7e6516163913c513e9e33d25cecdfc563a Mon Sep 17 00:00:00 2001 From: Chan Date: Sun, 13 Jul 2025 18:11:41 +0900 Subject: [PATCH 3/3] =?UTF-8?q?solution=EB=AA=85=20=EB=B3=80=EA=B2=BD2?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/week03/Chanjong/pg_68936.java | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/week03/Chanjong/pg_68936.java b/src/week03/Chanjong/pg_68936.java index 29ac974..65fb220 100644 --- a/src/week03/Chanjong/pg_68936.java +++ b/src/week03/Chanjong/pg_68936.java @@ -1,5 +1,5 @@ -class Solution { - public int[] solutionWeek3C(int[][] arr) { +class solutionWeek3C{ + public int[] Solution(int[][] arr) { return quadtree(arr, 0, 0, arr[0].length); }