UPDATE coding

Author: jukrap

Programmers/Lv1/12901.js

@@ -0,0 +1,7 @@
+//2016년
+function solution(a, b) {
+ var days = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"];
+ var date = new Date(2016, a - 1, b);
+ return days[date.getDay()];
+ }
+ 

Programmers/Lv1/1845.js

@@ -0,0 +1,7 @@
+//폰켓몬
+function solution(nums) {
+ var maxNums = nums.length / 2;
+ var uniqueNums = [...new Set(nums)];
+ return Math.min(maxNums, uniqueNums.length);
+ }
+ 

Programmers/Lv1/42576.js

@@ -0,0 +1,11 @@
+//완주하지 못한 선수
+function solution(participant, completion) {
+ participant.sort();
+ completion.sort();
+ for (var i = 0; i < participant.length; i++) {
+ if (participant[i] !== completion[i]) {
+ return participant[i];
+ }
+ }
+ return participant[participant.length - 1];
+}

Programmers/Lv1/68644.js

@@ -0,0 +1,13 @@
+//두 개 뽑아서 더하기
+function solution(numbers) {
+ const answer = [];
+ for (var i = 0; i < numbers.length; i++) {
+ for (var j = i + 1; j < numbers.length; j++) {
+ var sum = numbers[i] + numbers[j];
+ if (!answer.includes(sum)) {
+ answer.push(sum);
+ }
+ }
+ }
+ return answer.sort((a, b) => a - b);
+ }

Programmers/Lv2/12941.js

@@ -0,0 +1,10 @@
+//최솟값 만들기
+function solution(A, B) {
+ A.sort((a, b) => a - b);
+ B.sort((a, b) => b - a);
+ var answer = 0;
+ for (var i = 0; i < A.length; i++) {
+ answer += A[i] * B[i];
+ }
+ return answer;
+}

Programmers/Lv2/12945.js

@@ -0,0 +1,8 @@
+//피보나치 수
+function solution(n) {
+ var fibo = [0, 1];
+ for (var i = 2; i <= n; i++) {
+ fibo[i] = (fibo[i - 1] + fibo[i - 2]) % 1234567;
+ }
+ return fibo[n];
+}

Programmers/Lv2/12951.js

@@ -0,0 +1,10 @@
+//JadenCase 문자열 만들기
+function solution(s) {
+ var words = s.toLowerCase().split(' ');
+ for (var i = 0; i < words.length; i++) {
+ if (words[i] !== '') {
+ words[i] = words[i][0].toUpperCase() + words[i].slice(1);
+ }
+ }
+ return words.join(' ');
+}