느낌표 공장

  • 태그
  • 방명록

모의고사 1

[Python] 모의고사

def solution(answers): a = [1,2,3,4,5] b = [2,1,2,3,2,4,2,5] c = [3,3,1,1,2,2,4,4,5,5] count_1 = 0 count_2 = 0 count_3 = 0 for i in range(len(answers)) : if a[i%len(a)] == answers[i] : count_1 += 1 if b[i%len(b)] == answers[i] : count_2 += 1 if c[i%len(c)] == answers[i] : count_3 += 1 score_list = [count_1, count_2, count_3] answer = [] for x, y in enumerate(score_list): if y == max(score_list) ..

Algorithm/Programmers 2021.04.06
1
더보기
프로필사진

  • 전체보기
    • CS
    • Language
      • Python
      • Java
      • JavaScript
      • MySQL
    • Web
      • Spring
    • Data Science
      • Machine Learning
      • 설치
    • Algorithm
      • 개념
      • Programmers
      • Baekjoon
      • SW Expert Academy
    • Mac
    • 기타
      • IntelliJ
      • 영감

Tag

programmers, dfs, 프로그래머스, Dijkstra, dp, binary search, Queue, BFS, Backtracking, swea, Two Pointer, java, stack, binary, Python, 자바, BOJ, 파이썬, greedy, Spring,

최근글과 인기글

  • 최근글
  • 인기글

방문자수Total

  • Today :
  • Yesterday :

Copyright © Kakao Corp. All rights reserved.

  • Github

티스토리툴바