Merge pull request #94 from zaqquum/main

Hongjoo/11월 3주차 / 3문제

Author: learntosurf

Hongjoo/lv2/숫자의표현.py

@@ -0,0 +1,37 @@
+'''
+[문제] : https://school.programmers.co.kr/learn/courses/30/lessons/12924#
+[Flow]
+연속된 자연수의 조합-> two point 
+0. 초기화
+ start == end-1 = 0
+while end <=  len(words)  and start < end 
+1. sum(words[start,end]) < target
+    -> end += 1
+2.  sum(words[start,end]) == target
+    -> count += 1 
+    -> start += 1 
+    -> end = start +1  
+
+3.  sum(words[start,end]) > 0 
+    -> 2와 동일 
+    
+'''
+def solution(n):
+    answer = 1 # 본인= target
+    start = 0 ; end  = start +1 ;
+    answer_li = []
+    half= round(n//2) +2 
+    field = range(1,half) # 반올림 
+    field = list(field)
+
+    while n > 2 and end <=  len(field)  and start < end  and start < len(field): #
+        current =sum(field[start : end])
+        if current < n : 
+            end += 1
+        else : # currnet >= n
+            if current == n : 
+                answer += 1
+                answer_li.append([start, end])
+            start += 1
+            end = start +1 
+    return answer

Hongjoo/백준/문자열교환.py

@@ -4,12 +4,13 @@
 
 words= input()
 window_size = words.count("a") # 1. a의 개수 = sliding window 크기
-result = 999999999 
+result = 99999999
 
 # 원형 문자열
 words += words[0:window_size-1]
 # 2. 최대한 a 가 연속해 있는 idx 범위 찾기
 for start in range(len(words) - (window_size-1)):
     result = min(result, words[start: start+ window_size].count("b"))
 
-print(result)
+print(result)
+

Hongjoo/백준/부분합.py

@@ -1,5 +1,10 @@
 """
+문제 : # 1806부분합
 https://www.acmicpc.net/problem/1806
+
+해설 :
+https://aia1235.tistory.com/46
+
 """
 import sys
 N ,S = map(int, sys.stdin.readline().split())
@@ -17,11 +22,11 @@
         end += 1 
         if end < N : 
             partial_sum += arr[end]
-        else :  # 수열 끝 -> 조건 충족 x
+        else :  #반복문 끝
             break  
 
 
-if min_length == 100000 : 
+if min_length == 100000 : # 수열 끝 -> 조건 충족 x
     print(0)
 else : 
     print(min_length)