33//정답 1 - codeisneverodd
44function solution ( numbers ) {
55 var answer = - 1 ;
6- answer = 45 - numbers . reduce ( ( a , b ) => a + b )
6+ answer = 45 - numbers . reduce ( ( a , b ) => a + b ) ;
77 return answer ;
88}
99
1010//정답 2 - codeisneverodd
1111function solution ( numbers ) {
1212 var answer = 0 ;
1313 for ( let i = 0 ; i < 10 ; i ++ ) {
14- answer += numbers . includes ( i ) ? 0 : i
14+ answer += numbers . includes ( i ) ? 0 : i ;
1515 }
1616 return answer ;
1717}
@@ -20,22 +20,33 @@ function solution(numbers) {
2020function solution ( numbers ) {
2121 var answer = - 1 ;
2222
23- let arr = [ 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 ] ;
23+ let arr = [ 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 ] ;
2424 let arr_sum = 0 ;
2525 let numbers_sum = 0 ;
2626
27- for ( i = 0 ; i < arr . length / 2 ; i ++ ) {
28- if ( arr [ i ] == arr [ arr . length - 1 - i ] ) {
29- arr_sum += arr [ i ]
27+ for ( i = 0 ; i < arr . length / 2 ; i ++ ) {
28+ if ( arr [ i ] == arr [ arr . length - 1 - i ] ) {
29+ arr_sum += arr [ i ] ;
3030 } else {
31- arr_sum += arr [ i ] + arr [ arr . length - 1 - i ]
32- }
31+ arr_sum += arr [ i ] + arr [ arr . length - 1 - i ] ;
32+ }
3333 }
3434
35- for ( i = 0 ; i < numbers . length ; i ++ ) {
36- numbers_sum += numbers [ i ]
35+ for ( i = 0 ; i < numbers . length ; i ++ ) {
36+ numbers_sum += numbers [ i ] ;
3737 }
3838
3939 answer = arr_sum - numbers_sum ;
4040 return answer ;
4141}
42+ 43+ //정답 3 - prove-ability
44+ function solution ( numbers ) {
45+ var answer = 0 ;
46+ 47+ for ( let i = 0 ; i < 10 ; i ++ ) {
48+ if ( ! numbers . includes ( i ) ) answer += i ;
49+ }
50+ 51+ return answer ;
52+ }
0 commit comments