Solved 2 problems

Author: gyeong-hyeon-kim

level-2/H-Index.js

@@ -0,0 +1,24 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1
+function solution(citations) {
+    var answer = 0;
+    citations.sort((a,b)=>b-a)
+    let h = 0
+    while(h+1<=citations[h]) h++
+    answer = h
+    return answer;
+}
+
+//정답 2
+function solution(citations) {
+    var answer = 0;
+    let h = 0
+    let length = 0
+    while(length >= h){
+        h++
+        length = citations.filter(citation => citation>=h).length
+    }
+    answer = h - 1
+    return answer;
+}

level-2/타겟-넘버.js

@@ -0,0 +1,15 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+function solution(numbers, target) {
+    var answer = 0;
+    const binaryLength = numbers.length
+    const binary = 2**binaryLength
+    for(let i=0; i<binary; i++){
+        const numSlice = numbers.slice()
+        const binaryString = i.toString(2).padStart(binaryLength, '0')
+        for(let j=0; j<binaryString.length; j++) binaryString[j] === '0' ? numSlice[j] *= -1 : null
+        const calculated = numSlice.reduce((prev, current) => prev + current)
+        if(calculated === target) answer += 1
+    }
+    return answer;
+}