Merge pull request #833 from khw970421/master

[야근 지수]

Author: sangmandu

programmers/난이도별/level02.H-Index/khw970421.js

@@ -2,19 +2,17 @@
 
 function solution(citations) {
     var answer = 0;
-    let a=[];
-    let b=[];
-    citations.sort((A,B)=>A-B);
-
-    for(let i=citations.length;i>0;i--)
-    {
-        for(let j=0;j<citations.length;j++)
-        {
-            if(citations[j]>=i){
-                a = citations.slice(0,j);
-                b = citations.slice(j,citations.length);
-
-                if(a.length<=i&&b.length>=i){
+    let a = [];
+    let b = [];
+    citations.sort((A, B) => A - B);
+
+    for (let i = citations.length; i > 0; i--) {
+        for (let j = 0; j < citations.length; j++) {
+            if (citations[j] >= i) {
+                a = citations.slice(0, j);
+                b = citations.slice(j, citations.length);
+
+                if (a.length <= i && b.length >= i) {
                     return i;
                 }
             }
@@ -29,13 +27,13 @@ function solution(citations) {
 function solution(citations) {
     citations = citations.sort(sorting);
     var i = 0;
-    while(i + 1 <= citations[i]){
+    while (i + 1 <= citations[i]) {
         i++;
     }
     return i;
 
 
-    function sorting(a, b){
+    function sorting(a, b) {
         return b - a;
     }
 }

programmers/난이도별/level03.야근_지수/khw970421.js

@@ -0,0 +1,21 @@
+function solution(n, works) {
+  works.sort((a,b)=>(b-a))
+
+  if(works.reduce((acc,val)=>acc+val ,0) < n )
+    return 0;
+
+  while(n>0)
+  {
+    for(let i=0;;i++)
+    {
+      works[i]--;
+      n--;
+      if(works[i]+1 !== works[i+1] || n===0)
+        break;
+    }
+  }
+  return works.reduce((acc,val)=>acc+val*val ,0);
+}
+
+//문제 출처 : https://programmers.co.kr/learn/courses/30/lessons/12927#
+//코드 정리 : https://velog.io/@khw970421/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4-%EC%95%BC%EA%B7%BC-%EC%A7%80%EC%88%98