Merge branch 'DaleStudy:main' into main

Author: devyulbae

.github/workflows/integration.yaml

@@ -17,11 +17,11 @@ jobs:
         run: |
           echo "🔍 PR 번호: ${{ github.event.pull_request.number }}"
           pr_number="${{ github.event.pull_request.number }}"
-          
+
           echo "📋 PR 라벨 조회 중..."
           labels_json=$(gh pr view $pr_number --json labels -q '.labels[].name')
           echo "확인된 라벨: $labels_json"
-          
+
           if [ -n "$labels_json" ]; then
             has_maintenance=$(echo $labels_json | grep -q 'maintenance' && echo 'true' || echo 'false')
             echo "maintenance 라벨 포함 여부: $has_maintenance"

.github/workflows/management.yaml

@@ -11,6 +11,11 @@ on:
         options:
           - approve-prs
           - merge-prs
+      week:
+        description: 'Week number to filter (optional, e.g., "1")'
+        required: false
+        type: string
+        default: ""
       exclude_prs:
         description: 'PR numbers to exclude (comma-separated, e.g., "1972,1973")'
         required: false
@@ -40,11 +45,20 @@ jobs:
             excludes="[$(echo "$exclude_input" | sed 's/,/, /g')]"
           fi
 
+          # Build request payload
+          week_input="${{ inputs.week }}"
+          if [ -z "$week_input" ]; then
+            payload="{\"repo_name\": \"${{ github.event.repository.name }}\", \"excludes\": $excludes}"
+          else
+            payload="{\"repo_name\": \"${{ github.event.repository.name }}\", \"week\": \"Week $week_input\", \"excludes\": $excludes}"
+          fi
+
+          echo "주차 필터: ${week_input:-전체}"
           echo "제외할 PR: $excludes"
 
           response=$(curl -s -X POST "https://github.dalestudy.com/approve-prs" \
             -H "Content-Type: application/json" \
-            -d "{\"repo_name\": \"${{ github.event.repository.name }}\", \"excludes\": $excludes}")
+            -d "$payload")
 
           echo "response=$response" >> $GITHUB_OUTPUT
           echo "$response" | jq '.'
@@ -55,6 +69,10 @@ jobs:
 
           success=$(echo "$response" | jq -r '.success // false')
           total=$(echo "$response" | jq -r '.total_open_prs // 0')
+          week_filter=$(echo "$response" | jq -r '.week_filter // null')
+          week_matched=$(echo "$response" | jq -r '.week_matched // 0')
+          week_mismatched=$(echo "$response" | jq -r '.week_mismatched // 0')
+          solving_excluded=$(echo "$response" | jq -r '.solving_excluded // 0')
           processed=$(echo "$response" | jq -r '.processed // 0')
           approved=$(echo "$response" | jq -r '.approved // 0')
           skipped=$(echo "$response" | jq -r '.skipped // 0')
@@ -69,18 +87,42 @@ jobs:
           fi
 
           echo "" >> $GITHUB_STEP_SUMMARY
+          if [ "$week_filter" != "null" ]; then
+            echo "- 🗓️  주차 필터: **$week_filter**" >> $GITHUB_STEP_SUMMARY
+          fi
           echo "- 📋 전체 Open PR: **$total**개" >> $GITHUB_STEP_SUMMARY
+          if [ "$week_filter" != "null" ]; then
+            echo "- ✅ $week_filter 매칭: **$week_matched**개" >> $GITHUB_STEP_SUMMARY
+            echo "- ❌ Week 불일치: **$week_mismatched**개" >> $GITHUB_STEP_SUMMARY
+            echo "- 🔄 Solving 상태 제외: **$solving_excluded**개" >> $GITHUB_STEP_SUMMARY
+          fi
           echo "- 🔍 검사한 PR: **$processed**개" >> $GITHUB_STEP_SUMMARY
           echo "- ✅ 승인한 PR: **$approved**개" >> $GITHUB_STEP_SUMMARY
           echo "- ⏭️  건너뛴 PR: **$skipped**개" >> $GITHUB_STEP_SUMMARY
 
           # Show detailed results if available
-          results=$(echo "$response" | jq -r '.results // []')
-          if [ "$results" != "[]" ]; then
+          result_count=$(echo "$response" | jq -r '.results | length')
+          if [ "$result_count" -gt 0 ]; then
             echo "" >> $GITHUB_STEP_SUMMARY
             echo "### 📝 상세 결과" >> $GITHUB_STEP_SUMMARY
             echo "" >> $GITHUB_STEP_SUMMARY
-            echo "$response" | jq -r '.results[] | "- PR #\(.pr_number): \(.status) \(if .reason then "(\(.reason))" else "" end)"' >> $GITHUB_STEP_SUMMARY
+
+            echo "$response" | jq -c '.results[]' | while read -r item; do
+              pr=$(echo "$item" | jq -r '.pr')
+              title=$(echo "$item" | jq -r '.title')
+              skipped=$(echo "$item" | jq -r '.skipped // false')
+              approved=$(echo "$item" | jq -r '.approved // false')
+              reason=$(echo "$item" | jq -r '.reason // ""')
+              error=$(echo "$item" | jq -r '.error // ""')
+
+              if [ "$skipped" = "true" ]; then
+                echo "- PR #$pr [$title]: ⏭️ skipped ($reason)" >> $GITHUB_STEP_SUMMARY
+              elif [ "$approved" = "true" ]; then
+                echo "- PR #$pr [$title]: ✅ approved" >> $GITHUB_STEP_SUMMARY
+              else
+                echo "- PR #$pr [$title]: ❌ failed (${error:-unknown})" >> $GITHUB_STEP_SUMMARY
+              fi
+            done
           fi
 
   merge-prs:
@@ -105,13 +147,23 @@ jobs:
             excludes="[$(echo "$exclude_input" | sed 's/,/, /g')]"
           fi
 
+          # Build request payload
+          week_input="${{ inputs.week }}"
           merge_method="merge"
+
+          if [ -z "$week_input" ]; then
+            payload="{\"repo_name\": \"${{ github.event.repository.name }}\", \"merge_method\": \"$merge_method\", \"excludes\": $excludes}"
+          else
+            payload="{\"repo_name\": \"${{ github.event.repository.name }}\", \"merge_method\": \"$merge_method\", \"week\": \"Week $week_input\", \"excludes\": $excludes}"
+          fi
+
           echo "머지 방식: $merge_method"
+          echo "주차 필터: ${week_input:-전체}"
           echo "제외할 PR: $excludes"
 
           response=$(curl -s -X POST "https://github.dalestudy.com/merge-prs" \
             -H "Content-Type: application/json" \
-            -d "{\"repo_name\": \"${{ github.event.repository.name }}\", \"merge_method\": \"$merge_method\", \"excludes\": $excludes}")
+            -d "$payload")
 
           echo "response=$response" >> $GITHUB_OUTPUT
           echo "$response" | jq '.'
@@ -122,6 +174,10 @@ jobs:
 
           success=$(echo "$response" | jq -r '.success // false')
           total=$(echo "$response" | jq -r '.total_open_prs // 0')
+          week_filter=$(echo "$response" | jq -r '.week_filter // null')
+          week_matched=$(echo "$response" | jq -r '.week_matched // 0')
+          week_mismatched=$(echo "$response" | jq -r '.week_mismatched // 0')
+          solving_excluded=$(echo "$response" | jq -r '.solving_excluded // 0')
           processed=$(echo "$response" | jq -r '.processed // 0')
           merged=$(echo "$response" | jq -r '.merged // 0')
           skipped=$(echo "$response" | jq -r '.skipped // 0')
@@ -138,16 +194,40 @@ jobs:
 
           echo "" >> $GITHUB_STEP_SUMMARY
           echo "- 🔧 머지 방식: **$merge_method**" >> $GITHUB_STEP_SUMMARY
+          if [ "$week_filter" != "null" ]; then
+            echo "- 🗓️  주차 필터: **$week_filter**" >> $GITHUB_STEP_SUMMARY
+          fi
           echo "- 📋 전체 Open PR: **$total**개" >> $GITHUB_STEP_SUMMARY
+          if [ "$week_filter" != "null" ]; then
+            echo "- ✅ $week_filter 매칭: **$week_matched**개" >> $GITHUB_STEP_SUMMARY
+            echo "- ❌ Week 불일치: **$week_mismatched**개" >> $GITHUB_STEP_SUMMARY
+            echo "- 🔄 Solving 상태 제외: **$solving_excluded**개" >> $GITHUB_STEP_SUMMARY
+          fi
           echo "- 🔍 검사한 PR: **$processed**개" >> $GITHUB_STEP_SUMMARY
           echo "- ✅ 머지한 PR: **$merged**개" >> $GITHUB_STEP_SUMMARY
           echo "- ⏭️  건너뛴 PR: **$skipped**개" >> $GITHUB_STEP_SUMMARY
 
           # Show detailed results if available
-          results=$(echo "$response" | jq -r '.results // []')
-          if [ "$results" != "[]" ]; then
+          result_count=$(echo "$response" | jq -r '.results | length')
+          if [ "$result_count" -gt 0 ]; then
             echo "" >> $GITHUB_STEP_SUMMARY
             echo "### 📝 상세 결과" >> $GITHUB_STEP_SUMMARY
             echo "" >> $GITHUB_STEP_SUMMARY
-            echo "$response" | jq -r '.results[] | "- PR #\(.pr_number): \(.status) \(if .reason then "(\(.reason))" else "" end)"' >> $GITHUB_STEP_SUMMARY
+
+            echo "$response" | jq -c '.results[]' | while read -r item; do
+              pr=$(echo "$item" | jq -r '.pr')
+              title=$(echo "$item" | jq -r '.title')
+              skipped=$(echo "$item" | jq -r '.skipped // false')
+              merged=$(echo "$item" | jq -r '.merged // false')
+              reason=$(echo "$item" | jq -r '.reason // ""')
+              error=$(echo "$item" | jq -r '.error // ""')
+
+              if [ "$skipped" = "true" ]; then
+                echo "- PR #$pr [$title]: ⏭️ skipped ($reason)" >> $GITHUB_STEP_SUMMARY
+              elif [ "$merged" = "true" ]; then
+                echo "- PR #$pr [$title]: ✅ merged" >> $GITHUB_STEP_SUMMARY
+              else
+                echo "- PR #$pr [$title]: ❌ failed (${error:-unknown})" >> $GITHUB_STEP_SUMMARY
+              fi
+            done
           fi

3sum/WHYjun.py

@@ -0,0 +1,29 @@
+class Solution:
+    def threeSum(self, nums: List[int]) -> List[List[int]]:
+        answer = []
+        sortedNums = sorted(nums)
+
+        for i in range(len(sortedNums)):
+            # skip if same to avoid dup
+            if i > 0 and sortedNums[i] == sortedNums[i-1]:
+                continue
+
+            # use two pointers
+            j = i + 1
+            k = len(sortedNums) - 1
+
+            while j < k:
+                total = sortedNums[i] + sortedNums[j] + sortedNums[k]
+
+                if total == 0:
+                    answer.append([sortedNums[i], sortedNums[j], sortedNums[k]])
+                    j += 1
+                    # skip if same to avoid dup
+                    while sortedNums[j] == sortedNums[j-1] and j < k:
+                        j += 1
+                elif total < 0:
+                    j += 1
+                else:
+                    k -= 1
+
+        return answer

3sum/daiyongg-kim.py

@@ -0,0 +1,36 @@
+class Solution:
+    def threeSum(self, nums: List[int]) -> List[List[int]]:
+        nums.sort()
+
+        result = []
+        n = len(nums)
+
+        for i in range(n - 2):
+            
+            if i > 0 and nums[i] == nums[i - 1]:
+                continue
+            
+            left = i + 1  
+            right = n - 1 
+            while left < right:
+                current_sum = nums[i] + nums[left] + nums[right]
+
+                if current_sum == 0:
+                    result.append([nums[i], nums[left], nums[right]])
+
+                    while left < right and nums[left] == nums[left + 1]:
+                        left += 1
+
+                    while left < right and nums[right] == nums[right - 1]:
+                        right -= 1
+                        
+                    left += 1
+                    right -= 1
+                 
+                elif current_sum < 0:
+                    left += 1
+                
+                else: 
+                    right -= 1
+            
+        return result

3sum/haxr369.java

@@ -0,0 +1,64 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Set;
+
+/**
+ * 세 수의 인덱스가 모두 다르고 세 수 합이 0인 경우의 수를 구하기
+ * 세 숫자가 들어간 배열은 중복되게 하지 않은다.
+ * 
+ * 1. 모든 경우의 수를 구한다. => O(N^3)
+ * 3000*3000*3000 == 9*10^9 => 9억건...
+ * 2. left, mid, right라고 할 때, mid를 고정하고 left, right만 움직이는 two pointer를 응용하기
+ */
+class Solution {
+  /**
+   * Runtime: 545 ms (Beats 14.44%)
+   * Memory: 60.78 MB (Beats 5.38%)
+   * Space Complexity: O(N)
+   * - 정렬을 위한 공간 => O(N)
+   * - 세 수를 저장하기 위한 리스트 => O(3)
+   * > O(N) + O(3) => O(N)
+   * Time Complexity: O(NlogN)
+   * - 정렬을 위한 시간 => O(NlogN)
+   * - mid의 순회 => O(N)
+   * - two pointer 조회 => O(N)
+   * > O(NlogN) + O(N)*O(N) ~= O(N^2)
+   */
+  public List<List<Integer>> threeSum(int[] nums) {
+    int L = nums.length;
+    Arrays.sort(nums);
+
+    Set<List<Integer>> st = new HashSet<>();
+
+    // mid를 늘려가면서 투 포인터 진행
+    for (int mid = 1; mid < L - 1; mid++) {
+      int left = 0;
+      int right = L - 1;
+      while (left < mid && mid < right) {
+        int sm = nums[left] + nums[mid] + nums[right];
+        if (sm == 0) {
+          /**
+           * left를 더하는 이유:
+           * 현재 찾은 경우의 수 외에 다른 경우가 존재할 수 있음
+           * ex) -7,1,6 / -6,1,5
+           * => mid는 고정이지만, left는 늘리고 right를 줄여서 0을 만들 수 있는 다른 경우가 있음
+           */
+          List<Integer> li = new ArrayList<>();
+          li.add(nums[left]);
+          li.add(nums[mid]);
+          li.add(nums[right]);
+          st.add(li); // 중복값이 있어도 무시할 수 있음.
+          left++;
+        } else if (sm < 0) { // 부족하면 left 늘리기
+          left++;
+        } else { // 과하면 right 줄이기
+          right--;
+        }
+      }
+    }
+
+    return new ArrayList<>(st);
+  }
+}

3sum/ppxyn1.py

@@ -0,0 +1,32 @@
+# idea: sorting + two pointer
+# The idea was straightforward, but remove the duplication logic was the tricky.
+
+class Solution:
+    def threeSum(self, nums: List[int]) -> List[List[int]]:
+        nums.sort()
+        n = len(nums)
+        answer = []
+
+        for i in range(n):
+            if i > 0 and  nums[i] == nums[i-1]:
+                continue
+
+            left, right = i+1, n-1
+
+            while left < right:
+                s = nums[i] + nums[left] + nums[right]
+                if s == 0:
+                    answer.append([nums[i], nums[left], nums[right]])
+                    while left < right and nums[left] == nums[left+1]:
+                        left += 1
+                    while left < right and nums[right] == nums[right-1]:
+                        right -= 1
+                    left += 1
+                    right -= 1
+                elif s < 0:
+                    left += 1
+                else:
+                    right -= 1
+        return answer
+
+