본문 바로가기

끄적끄적

검색하기
끄적끄적
프로필사진 Go0G

  • 분류 전체보기 (65)
    • Computer Science (0)
    • Security (30)
      • Web (8)
      • System (0)
      • Server (0)
      • Mobile (17)
      • Bugbounty (1)
      • Database (2)
      • Crypto (0)
    • Network (1)
      • Protocol (0)
    • Development (29)
      • JSP (23)
      • JavaScript (3)
      • Python (0)
      • Android(Kotlin) (2)
      • Algorism (1)
    • Cloud (0)
      • AWS (0)
      • Azure (0)
      • NCP (0)
      • GCP (0)
    • Law (1)
      • 개인정보보호법 (1)
      • 정보통신망법 (0)
      • 전자금융거래법 (0)
    • ETC (1)
      • Docker (1)
Guestbook
Notice
Recent Posts
Recent Comments
Link
Tags
  • CVE-2022-22965
  • CVE-2014-0094
  • NoSQL
  • DOM
  • Hackthebox cat
  • Directory traversal
  • PortSwigger
  • UnCrackable level 1
  • Android Backup
  • JSP
  • File Upload
  • MariaDB
  • mongoDB
  • HackTheBox
  • CVE-2010-1622
  • Frida
  • mstg
  • getCachedIntrospectionResults
  • HackTheBox APKey
  • Android 6.0
  • xss
  • SeeTheSharpFlag
  • JAVA ClassLoader 취약점
  • nginx
  • XALZ 압축해제
  • Xamarin 분석
  • HacktheBox Mobile
  • login form
  • UnCrackable
  • blind sql injection
more
Archives
Today
Total
관리 메뉴
  • 글쓰기
  • 방명록
  • 관리
  • 관리

목록Development/Algorism (1)

끄적끄적

[Programmers] 로또의 최고 순위와 최저 순위

문제 URL 더보기 https://programmers.co.kr/learn/courses/30/lessons/77484 def solution(lottos, win_nums): lot_dic = {6:1,5:2,4:3,3:4,2:5,1:6,0:6} #Dictionary 선언 cont_0 = [(i) for i in lottos if i==0] #for내 If문으로 변수 초기화 accord = 0 answer = [] for i in lottos: if i in win_nums: accord +=1 answer.append(lot_dic[accord+len(cont_0)]) answer.append(lot_dic[accord]) return answer

Development/Algorism 2021. 9. 2. 17:38
Prev 1 Next

Blog is powered by kakao / Designed by Tistory

티스토리툴바