알고리즘 썸네일형 리스트형 [알고리즘] Leetcode #179 가장 큰 수 (Python) ↓↓↓ 아래는 내 리트코드 & 깃허브 계정 ↓↓↓ leetcode.com/Jiwon_Lee/ Jiwon Lee - LeetCode Profile Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com https://github.com/GodJiLee GodJiLee - Overview Interested in Data Science. GodJiLee has 17 repositories available. Follow their code on GitHub. github.com Leetco.. 더보기 [알고리즘] Leetcode #147 삽입 정렬 리스트 (Python) ↓↓↓ 아래는 내 리트코드 & 깃허브 계정 ↓↓↓ leetcode.com/Jiwon_Lee/ Jiwon Lee - LeetCode Profile Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com https://github.com/GodJiLee GodJiLee - Overview Interested in Data Science. GodJiLee has 17 repositories available. Follow their code on GitHub. github.com Leetco.. 더보기 [알고리즘] Leetcode #56 구간 병합 (Python) ↓↓↓ 아래는 내 리트코드 & 깃허브 계정 ↓↓↓ leetcode.com/Jiwon_Lee/ Jiwon Lee - LeetCode Profile Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com https://github.com/GodJiLee GodJiLee - Overview Interested in Data Science. GodJiLee has 17 repositories available. Follow their code on GitHub. github.com Leetco.. 더보기 [알고리즘] Leetcode #148 리스트 정렬 (Python) ↓↓↓ 아래는 내 리트코드 & 깃허브 계정 ↓↓↓ leetcode.com/Jiwon_Lee/ Jiwon Lee - LeetCode Profile Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com https://github.com/GodJiLee GodJiLee - Overview Interested in Data Science. GodJiLee has 17 repositories available. Follow their code on GitHub. github.com 안정 정렬 .. 더보기 [알고리즘] 정렬(Sorting) - 버블 정렬, 병합 정렬, 퀵 정렬 정렬 목록의 요소를 특정 순서대로 넣는 알고리즘 대개 숫자식 순서(numeric order)와 사전식 순서(lexigraphical order)로 정렬함 버블 정렬 복잡도 O(n^2)으로 비효율적인 편 # 버블 정렬 수도코드 Bubblesort(A) for i from 1 to A.length for j from 0 to A.length - 1 if A[j] > A[j + 1] swap a[j] with a[j + 1] def bubblesort(A): for i in range(1, len(A)): for j in range(1, len(A) - 1): if A[j] > A[j + 1]: A[j], A[j + 1] = A[j + 1], A[j] # swap 병합 정렬 최선과 최악 모두 O(n log n.. 더보기 [알고리즘] Leetcode #336 팰린드롬 페어 (Python) ↓↓↓ 아래는 내 리트코드 & 깃허브 계정 ↓↓↓ leetcode.com/Jiwon_Lee/ Jiwon Lee - LeetCode Profile Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com https://github.com/GodJiLee GodJiLee - Overview Interested in Data Science. GodJiLee has 17 repositories available. Follow their code on GitHub. github.com 문제 설명 .. 더보기 [알고리즘] Leetcode #215 배열의 K번째 큰 요소 (Python) ↓↓↓ 아래는 내 리트코드 계정 ↓↓↓ leetcode.com/Jiwon_Lee/ Jiwon Lee - LeetCode Profile Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 설명 Given an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in the sorted order, not the kt.. 더보기 [알고리즘] Leetcode #105 전위, 중위 순회 결과로 이진 트리 구축(Python) ↓↓↓ 아래는 내 리트코드 계정 ↓↓↓ leetcode.com/Jiwon_Lee/ Jiwon Lee - LeetCode Profile Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 설명 Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, con.. 더보기 이전 1 2 3 4 5 다음
