Haribo Blog

• 당뇨병 예측[데이터셋 훑어보기]

  2021-03-14

  Haribo

  ML  AI

  pre_process
  • 당뇨병 환자 예측 모델링

  당뇨병 환자 예측 모델링

  data shape : 2000000 x 28

  # data analysis and wrangling
  import pandas as pd
  import numpy as np
  import random as rnd
  pd.set_option('display.max_columns', 100)
  
  
  # visualization
  import seaborn as sns
  import matplotlib.pyplot as plt
  %matplotlib inline
  
  # machine learning
  from sklearn.linear_model import LogisticRegression
  from sklearn.svm import SVC, LinearSVC
  from sklearn.ensemble import RandomForestClassifier
  from sklearn.neighbors import KNeighborsClassifier
  from sklearn.naive_bayes import GaussianNB
  from sklearn.linear_model import Perceptron
  from sklearn.linear_model import SGDClassifier
  from sklearn.tree import DecisionTreeClassifier
  

  Read All

  ---

• itertools

  2021-03-10

  Haribo

  노트

  python_module
  • 무한 이터레이터
  • 이터레이터
  • 조합형

  itertools는 버릴것 하나없는 아주 유용한 모듈이다.

  무한 이터레이터

  • count
  • cycle
  • repeat

  이터레이터

  • accumulate
  • chain
  • chain.from_iterable
  • compress
  • dropwhile
  • filterfalse
  • groupby
  • islice
  • tee
  • zip_longest

  조합형

  • product
  • permutations
  • combinations
  • combinations_with_replacement

  Read All

  ---

• functools

  2021-03-09

  Haribo

  노트

  python_module

  functools 모듈안에 함수가 꽤많지만 내가 판단했을 때, 코딩테스트에 필요한 함수 몇가지들만 추려보았다. 코딩테스트에는 딱히 객체지향적인 프로그램이 필요하지 않기 때문에, class에 관련된 함수는 제외하였다.

  • lru_cache
  • reduce

  Read All

  ---

• 파이썬 모든 문제 푼 후기

  2021-03-05

  Haribo

  프로그래머스  노트

  코딩테스트

  

  Java문제(15) + SQL 문제(9) 제외

  ---

  Read All

  ---

• 문자열의 아름다움

  2021-03-05

  Haribo

  프로그래머스  월간_코드_챌린지_시즌1

  Lv.5

  teferi풀이 원문

  from collections import defaultdict
  from itertools import groupby
  def solution(s):
      lumps = defaultdict(lambda: defaultdict(int))
      for char, group in groupby(s):
          lumps[char][len(list(group))] += 1
      unpretty = ((n := len(s)) - 1) * n * (n + 1) // 6
      for lump in lumps.values():
          total = sum(l * count for l, count in lump.items())
          both_side = sum(lump.values())
          for i in range(1, max(lump) + 1):
              unpretty -= total * (total - 1) // 2
              total -= both_side
              both_side -= lump[i]
      return unpretty
  

  Read All

  ---

• 블록 게임

  2021-03-04

  Haribo

  프로그래머스  2019_KAKAO_BLIND_RECRUITMENT

  Lv.4

  풀이 원문

  from collections import defaultdict
  def fill_black(board, h, w):
      board[h][w] = (-1 if h == 0 or board[h - 1][w] == -1 else 0)
  def check(block, blocks, board) :
      if len(blocks) < 4 : return False
      h_list = sorted([h for h, w in blocks])
      w_list = sorted([w for h, w in blocks])
      for h in range(h_list[0], h_list[-1] + 1):
          if any(color not in (-1, block) for color in board[h][w_list[0]:w_list[-1] + 1]):
              return False
      return True
  def solution(board):
      blocks = defaultdict(list)
      answer = 0
      for h in range((n := len(board))) :
          for w in range(n) :
              if (block := board[h][w]) > 0 :
                  (block_points := blocks[block]).append((h, w))
                  if not check(block, block_points, board) :
                      continue
                  answer += 1
                  for bh, bw in block_points :
                      fill_black(board, bh, bw)
              elif block == 0 :
                  fill_black(board, h, w)
      return answer
  

  Read All

  ---

• [3차] 자동완성

  2021-03-04

  Haribo

  프로그래머스  2018_KAKAO_BLIND_RECRUITMENT

  Lv.4  Tree

  가사검색 문제와 비슷함. Trie Tree 를 이용한 문제

  def solution(words):
      tree = Trie()
      for word in words :
          tree.insert(word)
      return sum(tree.query(word) for word in words)
    
  class TrieNode:
      def __init__(self, char):
          self.char = char
          self.counter = 0
          self.children = {}
  class Trie(object):
      def __init__(self):
          self.root = TrieNode("")
      def insert(self, word):
          node = self.root
          for char in word:
              node.counter += 1
              if char in node.children:
                  node = node.children[char]
              else:
                  new_node = TrieNode(char)
                  node.children[char] = new_node
                  node = new_node
          node.counter += 1
      def query(self, word) :
          node = self.root
          for i, char in enumerate(word) :
              node = node.children[char]
              if node.counter == 1 :
                  return i+1
          return len(word)
  

  Read All

  ---

• 무지의 먹방 라이브

  2021-03-04

  Haribo

  프로그래머스  2019_KAKAO_BLIND_RECRUITMENT

  Lv.4

  from itertools import accumulate
  def solution(food_times, k):
      n = len(food_times)
      food_acc = list(accumulate((f := [0] + sorted(food_times))))
      for i in range(1, n+1) :
          if food_acc[i] + (n-i)*f[i] > k : 
              remain_food = [index+1 for index, food in enumerate(food_times) if food >= f[i]]
              idx = (k - (food_acc[i-1] + (n-(i-1))*f[i-1])) % (n-(i-1)) 
              return remain_food[idx]
      return -1 
  

  Read All

  ---

• 지형 편집

  2021-03-03

  Haribo

  프로그래머스  Summer/Winter_Coding(~2018)

  Lv.4

  from itertools import chain
  def solution(land, P, Q):
      land  = sorted(chain.from_iterable(land))
      k = len(land) * Q // (P + Q)
      h = land[k]
      return sum(h - x for x in land[:k])*P + sum(x - h for x in land[k:])*Q
  

  ---

  Read All

  ---

• 단어 퍼즐

  2021-03-02

  Haribo

  프로그래머스  2017_팁스타운

  Lv.4  DP

  풀이 원문

  def solution(strs, t):
      DP = [0] * ((n := len(t)) + 1)
      for i in range(1, n+1) :
          DP[i] = min((DP[k] + 1 for k in range(max(0, i - 5), i) if t[k:i] in strs), default = 1e6)
      return DP[-1] if DP[-1] < 1e6 else -1
  

  ---

  Read All

  ---