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

Author: doh6077

.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

climbing-stairs/WHYjun.py

@@ -0,0 +1,20 @@
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        dp = {}
+        return self.climbStairsRecursively(n, dp)
+
+    def climbStairsRecursively(self, n: int, dp: Dict[int, int]):
+        if n == 1:
+            dp[1] = 1
+            return dp[1]
+        if n == 2:
+            dp[2] = 2
+            return dp[2]
+
+        if n - 2 not in dp:
+            dp[n - 2] = self.climbStairsRecursively(n - 2, dp)
+
+        if n - 1 not in dp:
+            dp[n - 1] = self.climbStairsRecursively(n - 1, dp)
+
+        return dp[n - 2] + dp[n - 1]

climbing-stairs/chjung99.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int climbStairs(int n) {
+        int[] dp = new int[46];
+        dp[0] = 1;
+        dp[1] = 1;
+        dp[2] = dp[1] + dp[0];
+        dp[3] = dp[2] + dp[1];
+
+        for (int i = 4; i <= n; i++) {
+            dp[i] = dp[i-1] + dp[i-2];
+        }
+        return dp[n];
+    }
+}
+

contains-duplicate/1lsang.ts

@@ -0,0 +1,5 @@
+function containsDuplicate(nums: number[]): boolean {
+    // Javascript의 Set은 내부적으로 해시테이블을 이용해서, O(n)으로 중복 제거
+    const uniqueNums = Array.from(new Set(nums).values());
+    return uniqueNums.length !== nums.length;
+};

contains-duplicate/6kitty.py

@@ -0,0 +1,20 @@
+#
+# @lc app=leetcode id=217 lang=python3
+#
+# [217] Contains Duplicate
+#
+
+# @lc code=start
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        # list로 하니까 시간 초과 떠서 set으로 변경
+        idx=set()
+        for i in nums:
+            if i in idx:
+                return True
+            idx.add(i)
+        # null 방지 
+        return False
+        
+# @lc code=end
+

contains-duplicate/8804who.py

@@ -0,0 +1,4 @@
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        return len(set(nums)) != len(nums)
+    

contains-duplicate/Donghae0230.py

@@ -0,0 +1,12 @@
+# 시간 복잡도
+# 입력 list를 set으로 변환 -> 최대 O(n)
+# 공간 복잡도
+# 입력 list를 set으로 변환 -> 최대 O(n)
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        set_nums = set(nums)
+        list_nums = list(set_nums)
+        if len(nums) != len(list_nums):
+            return True
+        else:
+            return False

contains-duplicate/Geegong.java

@@ -9,17 +9,26 @@ public class Geegong {
      * time complexity : O(n)
      * space complexity : o(n)
      * @param nums
-     * @return
+     * @return boolean
      */
     public boolean containsDuplicate(int[] nums) {
+
+
+
         HashSet<Integer> uniques = new HashSet<>();
 
         for (int num : nums) {
-            if (uniques.contains(num)) {
+
+            // 명확하게 hashSet에 값이 있는지 체크하는 메소드로 확인이 가능하지만
+//            if (uniques.contains(num)) {
+//                return true;
+//            }
+//            uniques.add(num);
+
+            // hashSet 의 Add 는 이미 값이 있다면 FALSE를 리턴하기에 아래처럼도 동작 가능 (더 빠른 결과확인)
+            if (!uniques.add(num)) {
                 return true;
             }
-
-            uniques.add(num);
         }
 
         return false;