Merge branch 'main' of https://github.com/daiyongg-kim/leetcode-study

Author: daiyongg-kim

.github/workflows/integration.yaml

@@ -2,10 +2,12 @@ name: Integration 🔄
 
 on:
   pull_request:
+  merge_group:
 
 jobs:
   linelint:
     runs-on: ubuntu-latest
+    if: github.event_name == 'pull_request'
     steps:
       - uses: actions/checkout@v4
         with:
@@ -17,11 +19,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/8804who.py

@@ -0,0 +1,17 @@
+class Solution:
+    def threeSum(self, nums: List[int]) -> List[List[int]]:
+        temp = {}
+        answer = {}
+        nums.sort()
+        for i in range(len(nums)):
+            for j in range(i+1, len(nums)):
+                if -(nums[i]+nums[j]) in temp:
+                    ans = str(nums[i])+','+str(nums[j])   
+                    answer[ans] = 1
+            temp[nums[i]] = 1
+        temp_ans = []
+        for ans in answer.keys():
+            s1, s2 = ans.split(',')
+            temp_ans.append([int(s1), int(s2), -(int(s1)+int(s2))])
+        return temp_ans
+    

3sum/Baekwangho.ts

@@ -0,0 +1,146 @@
+/**
+합산이 0이 되는 서로소 조합을 찾아야 한다.. 좌표가 다른 같은 값은 허용하되,
+같은 수로 구성된 조합은 중복을 불허한다.
+
+기본적으로 3가지 수를 중복없이 조합해서 뽑은 다음, 정렬을 사용하여 set 으로 구분할 수 있지 않을까?
+
+
+function threeSum(nums: number[]): number[][] {
+  const arraySet = new Set<string>();
+
+  for (let i = 0; i <= nums.length - 3; i++) {
+    for (let j = i + 1; j <= nums.length - 2; j++) {
+      for (let k = j + 1; k <= nums.length - 1; k++) {
+        if (nums[i] + nums[j] + nums[k] === 0) {
+          const sorted = [nums[i], nums[j], nums[k]];
+          sorted.sort((a, b) => a - b);
+          const string = sorted.join("#");
+          arraySet.add(string);
+        }
+      }
+    }
+  }
+
+  return Array.from(arraySet).map((el) =>
+    el.split("#").map((el) => Number(el))
+  );
+}
+ */
+
+/**
+시간 초과해버렸다. 어떻게 효율적으로 풀 수 있을까?
+two sum 을 보니 해시테이블을 쓴다고 한다. nums 를 해시테이블로 변환하고,
+이중 반복문에서 이를 활용해보자.
+
+function threeSum(nums: number[]): number[][] {
+  const arraySet = new Set<string>();
+  const hash = new Map<number, number[]>();
+  nums.forEach((val, idx) => {
+    const idxes = hash.get(val);
+    if (idxes && idxes.length) {
+      hash.set(val, [...idxes, idx]);
+    } else {
+      hash.set(val, [idx]);
+    }
+  });
+
+  for (let i = 0; i < nums.length - 2; i++) {
+    for (let j = i + 1; j < nums.length - 1; j++) {
+      const idxes = hash.get(0 - (nums[i] + nums[j]));
+
+      idxes?.forEach((idx) => {
+        if (idx != i && idx != j) {
+          const sorted = [nums[i], nums[j], nums[idx]];
+          sorted.sort((a, b) => a - b);
+          const string = sorted.join("#");
+          arraySet.add(string);
+        }
+      });
+    }
+  }
+
+  return Array.from(arraySet).map((el) =>
+    el.split("#").map((el) => Number(el))
+  );
+}
+
+ */
+
+/**
+... 0으로만 가득찬 배열에서 time limit 이 발생했다.
+풀이를 보고오니, 위 로직에서 0으로 가득찬 arraySet 을 순회하는 곳에서 결국 O(n^3) 이 되어버린다는 점을 확인할 수 있었다.
+확실한 것은, 정렬을 추가했을 경우 위 로직도 통과 가능한 정도로 만들어볼 수 있지 않을까 싶었다.
+
+function threeSum(nums: number[]): number[][] {
+  nums.sort((a, b) => a - b);
+  const arraySet = new Set<string>();
+  const hash = new Map<number, number[]>();
+
+  nums.forEach((val, idx) => {
+    const idxes = hash.get(val);
+    if (idxes && idxes.length) {
+      hash.set(val, [...idxes, idx]);
+    } else {
+      hash.set(val, [idx]);
+    }
+  });
+
+  for (let i = 0; i < nums.length - 2; i++) {
+    for (let j = i + 1; j < nums.length - 1; j++) {
+      const idxes = hash.get(0 - (nums[i] + nums[j])) ?? [];
+
+      for (let k = 0; k < idxes.length; k++) {
+        const idx = idxes[k];
+        if (idx != i && idx != j) {
+          const sorted = [nums[i], nums[j], nums[idx]];
+          sorted.sort((a, b) => a - b);
+          const string = sorted.join("#");
+          arraySet.add(string);
+
+          break;
+        }
+      }
+    }
+  }
+
+  return Array.from(arraySet).map((el) =>
+    el.split("#").map((el) => Number(el))
+  );
+}
+
+근데 어떻게든 못만듦.
+ */
+
+/**
+어제 해답을 보았으니, 다시한번 풀어보자.
+핵심은 투 포인터를 사용하는 것, 자료구조에 얽메이지 않는 것
+ */
+
+function threeSum(nums: number[]): number[][] {
+  nums.sort((a, b) => a - b);
+  const results = [];
+
+  // [-4, -1, -1, 0, 1, 2]
+  for (let i = 0; i < nums.length; i++) {
+    while (nums[i - 1] === nums[i]) i++;
+
+    let low = i + 1;
+    let high = nums.length - 1;
+    while (low < high) {
+      const sum = nums[i] + nums[low] + nums[high];
+      if (sum < 0) {
+        low++;
+      } else if (sum > 0) {
+        high--;
+      } else {
+        while (nums[high] === nums[high - 1]) high--;
+        while (nums[low] === nums[low + 1]) low++;
+        results.push([nums[i], nums[low], nums[high]]);
+        low++;
+        high--;
+      }
+    }
+  }
+
+  return results;
+}