<div id="readability-page-1" class="page"><article id="mainContent">
                                <div>
                                    <p><a href="/m/category/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98"><span>알고리즘</span></a></p><h3>[백준 / javascript] 1874번 스택 수열</h3>
                                </div>
                                <p><cite>Suhyeon Lee</cite>
                                    <span> 2023. 4. 10. 15:26</span>
                                </p>
                                
                            <div>
                                <p data-ke-size="size16"><a href="https://www.acmicpc.net/problem/1874">https://www.acmicpc.net/problem/1874</a></p>
<pre><code>// 1874 : 스택 수열

const readFile = process.platform === 'linux' ? '/dev/stdin' : 't.txt';

const input = require('fs')
  .readFileSync(readFile)
  .toString()
  .trim()
  .split('\\n');

let [n, ...nums] = input;
nums = nums.map((n) =&gt; Number(n));

const stack = [];
let answer = '';
let cnt = 1;

for (let i = 0; i &lt; n; i++) {
  const num = nums.shift();

  while (cnt &lt;= num) {
    stack.push(cnt++);
    answer += '+';
  }

  const popNum = stack.pop();
  if (popNum !== num) {
    return console.log('NO');
  }
  answer += '-';
}
console.log(answer.split('').join('\\n'));
</code></pre>
            
            
                </div>
            


<ins data-ad-client="ca-pub-9527582522912841" data-ad-slot="3250933968" data-ad-format="auto" data-full-width-responsive="true" data-ad-type="inventory"></ins>


                                            
            
                            </article></div>

공부 기록하는 블로그

Suhyeon Lee

https://www.acmicpc.net/problem/1874
// 1874 : 스택 수열
const readFile = process.platform === 'linux' ? '/dev/stdin' : 't.txt';
const input = require('fs')
  .readFileSync(readFile)
  .toString()
  .trim()
  .split('\\n');
let [n, ...nums] = input;
nums = nums.map((n) => Number(n));
const stack = [];
let answer = '';
let cnt = 1;
for (let i = 0; i < n; i++) {
  const num = nums.shift();
  while (cnt <= num) {
    stack.push(cnt++);
    answer += '+';
  }
  const popNum = stack.pop();
  if (popNum !== num) {
    return console.log('NO');
  }
  answer += '-';
}
console.log(answer.split('').join('\\n'));

[백준 / javascript] 1874번 스택 수열

댓글