정렬 03 - H Index, 프로그래머스, 알고리즘, Programmers, Stack, Queue, Hash, 코딩테스트, Algorithm, 풀이과정, Leetcode, 릿코드, 코딩테스트, Tech interview, Heap, 힙, 정렬, sort

 

# Process

# 1. Input citations list

# 3. Iterate from maximum h index to lowest h index (0)

#  3.1. Count how many papers are having citation count over h index

#  3.2. Check if count is over h_index or not

#   3.3. If so -> h_index return

# 4. Finish

 

 

# # performace 올려야함

def solution(citations):

    for index in range(len(citations), 0, -1):

        count = 0

        for i in range(0, len(citations)):

            if citations[i] >= index:

                count += 1

                if count >= index:

                    return index

    return 0

 

2021.03.03 - [Algorithm/Programmers] - 정렬 01 - K번째수, 프로그래머스, 알고리즘, Programmers, Stack, Queue, Hash, 코딩테스트, Algorithm, 풀이과정, Leetcode, 릿코드, 코딩테스트, Tech interview, Heap, 힙, 정렬, sort

정렬 01 - K번째수, 프로그래머스, 알고리즘, Programmers, Stack, Queue, Hash, 코딩테스트, Algorithm, 풀이과

 

2020.09.06 - [Programming/Artificial Intelligence (AI)] - 강화학습 MDP 기본 개념1, Reinforcement Learning, Markov Decision Process, AI, Artificial Intelligence, agent, state, action, reward, Statistics

강화학습 MDP 기본 개념1, Reinforcement Learning, Markov Decision Process, AI, Artificial Intelligence, agent, state, act

 

2019.08.01 - [Algorithm/Leet Code] - LeetCode #872 LeafSimilarTree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접,연결리스..

LeetCode #872 LeafSimilarTree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문