내가 보는 세상 이야기

Lesson 4-4 - MaxCounters내용 : Calculate the values of counters after applying all alternating operations: increase counter by 1; set value of all counters to current maximum.문제 설명은 여기를 참고 http://hojak99.tistory.com/316 시간 복잡도 : O(N+M)80% 코드 :function solution(N, A) { // write your code in JavaScript (Node.js 6.4.0) let rt_arr = new Array(N); let max_counter = 0; let now_idx=0; rt_arr.fill(0); for..

Lesson 4-1 - PermCheck내용 : Check whether array A is a permutation.시간 복잡도 : O(N)성공한 코드function solution(A) { // write your code in JavaScript (Node.js 6.4.0) let A_len = A.length; let total = A_len*(A_len+1)/2; let rt_val = 0; let tmp_arr = {}; for(i in A) { rt_val += A[i]; tmp_arr[(A[i]-1).toString()] = A[i]; /* for [1,4,1] antisum test case */ } if(rt_val==total && Object.keys(tmp_arr).length =..