Solve : H-Index

Author: JeongHwan-dev

Diff for: Level2/H-Index.js

@@ -1,23 +1,18 @@
-function solution(citations) {
-  // 초기 인덱스 0으로 설정
-  let idx = 0;
+// Solution 1
+function solution1(citations) {
+  const _citations = citations.slice();
+  const n = _citations.length;
+  let HIndex = 0;
 
-  // 논문 인용 배열을 내림차순으로 정렬
-  citations.sort((a, b) => b - a);
+  _citations.sort((a, b) => b - a);
 
-  // 논문 인용 배열 길이 만큼 반복
-  while (idx <= citations.length) {
-    // 논문 인용 횟수가 현재 인용 횟수보다 작거나 같다면
-    if (idx + 1 <= citations[idx]) {
-      // 인덱스를 1씩 증가
-      idx++;
-    }
-    // 만약 현재 인용 횟수가 논문 인용 횟수보다 크다면
-    else {
-      // 반복문 종료
+  while (HIndex <= n) {
+    if (HIndex + 1 <= _citations[HIndex]) {
+      HIndex++;
+    } else {
       break;
     }
   }
 
-  return idx;
+  return HIndex;
 }

Diff for: README.md

@@ -59,6 +59,6 @@
 | :--------------------------: | :----------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
 | 1주차<br />(12.01. ~ 12.05.) | `Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1` | [체육복](https://programmers.co.kr/learn/courses/30/lessons/42862)<br />[소수 찾기](https://programmers.co.kr/learn/courses/30/lessons/12921)<br />[완주하지 못한 선수](https://programmers.co.kr/learn/courses/30/lessons/42576)<br />[음양 더하기](https://programmers.co.kr/learn/courses/30/lessons/76501)<br />[내적](https://programmers.co.kr/learn/courses/30/lessons/70128)<br />[없는 숫자 더하기](https://programmers.co.kr/learn/courses/30/lessons/86051)<br />[실패율](https://programmers.co.kr/learn/courses/30/lessons/42889)<br />[숫자 문자열과 영단어](https://programmers.co.kr/learn/courses/30/lessons/81301) | [JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/체육복.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/소수찾기.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/완주하지못한선수.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/음양더하기.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/내적.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/없는숫자더하기.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/실패율.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/숫자문자열과영단어.js) (2차 풀이) |
 | 2주차<br />(12.06. ~ 12.12.) |        `Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1`         |                                      [로또의 최고 순위와 최저 순위](https://programmers.co.kr/learn/courses/30/lessons/77484)<br />[소수 만들기](https://programmers.co.kr/learn/courses/30/lessons/12977)<br />[비밀지도](https://programmers.co.kr/learn/courses/30/lessons/17681)<br />[2016년](https://programmers.co.kr/learn/courses/30/lessons/12901)<br />[3진법 뒤집기](https://programmers.co.kr/learn/courses/30/lessons/68935)<br />[예산](https://programmers.co.kr/learn/courses/30/lessons/12982)<br />[최소직사각형](https://programmers.co.kr/learn/courses/30/lessons/86491)                                       |                                                         [JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/로또의최고순위와최저순위.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/소수만들기.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/비밀지도.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/2016년.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/3진법뒤집기.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/예산.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/최소직사각형.js) (2차 풀이)                                                          |
-| 3주차<br />(12.13. ~ 12.19.) |                       `Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 2`                        |                                                                                                                [나머지가 1이 되는 수 찾기](https://programmers.co.kr/learn/courses/30/lessons/87389)<br />[폰켓몬](https://programmers.co.kr/learn/courses/30/lessons/1845)<br />[다트 게임](https://programmers.co.kr/learn/courses/30/lessons/17682)<br />[신규 아이디 추천](https://programmers.co.kr/learn/courses/30/lessons/72410)<br />[가장 큰 수](https://programmers.co.kr/learn/courses/30/lessons/42746)                                                                                                                 |                                                                                                                                                                            [JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/나머지가1이되는수찾기.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/폰켓몬.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/다트게임.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/신규아이디추천.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level2/가장큰수.js) (2차 풀이)                                                                                                                                                                             |
+| 3주차<br />(12.13. ~ 12.19.) |                `Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 1`<br />`Level 2`<br />`Level 2`                |                                                                            [나머지가 1이 되는 수 찾기](https://programmers.co.kr/learn/courses/30/lessons/87389)<br />[폰켓몬](https://programmers.co.kr/learn/courses/30/lessons/1845)<br />[다트 게임](https://programmers.co.kr/learn/courses/30/lessons/17682)<br />[신규 아이디 추천](https://programmers.co.kr/learn/courses/30/lessons/72410)<br />[가장 큰 수](https://programmers.co.kr/learn/courses/30/lessons/42746)<br />[H-Index](https://programmers.co.kr/learn/courses/30/lessons/42747)                                                                            |                                                                                                                    [JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/나머지가1이되는수찾기.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/폰켓몬.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/다트게임.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level1/신규아이디추천.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level2/가장큰수.js) (2차 풀이)<br />[JS](https://github.com/JeongHwan-dev/programmers-solving-with-js/blob/master/Level2/H-Index.js) (2차 풀이)                                                                                                                    |
 | 4주차<br />(12.20. ~ 12.26.) |                                                         -                                                          |                                                                                                                                                                                                                                                                                                                  -                                                                                                                                                                                                                                                                                                                   |                                                                                                                                                                                                                                                                                                                                                                                                                                                                              -                                                                                                                                                                                                                                                                                                                                                                                                                                                                               |
 | 5주차<br />(12.27. ~ 12.31.) |                                                         -                                                          |                                                                                                                                                                                                                                                                                                                  -                                                                                                                                                                                                                                                                                                                   |                                                                                                                                                                                                                                                                                                                                                                                                                                                                              -                                                                                                                                                                                                                                                                                                                                                                                                                                                                               |