Algorithm
- ์ด์ง์ ๋ง์ -
๋ฌธ์
๋ ๊ฐ์ ์ด์ง์๋ฅผ ์ ๋ ฅ๋ฐ์ ์ด๋ฅผ ๋ํ๋ ํ๋ก๊ทธ๋จ์ ์์ฑํ์์ค.
์ ์ถ๋ ฅ ์์
๋ฌธ์ ํ๊ธฐ
const readline = require("readline");
const rl = readline.createInterface({ input: process.stdin, output: process.stdout, });
let input = [];
rl.on("line",
function (line) {
input = line.toString().split(" ").map((el) => el.split("").reverse());
}).on("close",
function () {
let longNum, shortNum;
if (input[0].length < input[1].length) {
longNum = input[1];
shortNum = input[0];
} else {
longNum = input[0];
shortNum = input[1];
}
let result = "";
let save = 0;
for (let i = 0; i < longNum.length; i++) {
if (shortNum[i] === undefined) shortNum[i] = 0;
if (+longNum[i] + +shortNum[i] + save === 0) {
result = "0" + result;
save = 0;
} else if (+longNum[i] + +shortNum[i] + save === 1) {
result = "1" + result;
save = 0;
} else if (+longNum[i] + +shortNum[i] + save === 2) {
result = "0" + result;
save = 1;
} else if (+longNum[i] + +shortNum[i] + save === 3) {
result = "1" + result;
save = 1;
}
}
result = save === 0 ? result : save + result;
let findOne = result.indexOf("1");
console.log(result.slice(findOne));
process.exit();
});
๋ฐ์ํ
'๊ฐ์ธ๊ณต๋ถ > Algorithm' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[๋ฐฑ์ค][Node.js] 1330๋ฒ : ๋ ์ ๋น๊ตํ๊ธฐ (0) | 2021.06.22 |
---|---|
[๋ฐฑ์ค][Node.js] 1292๋ฒ : ์ฝ๊ฒ ํธ๋ ๋ฌธ์ (1) | 2021.06.21 |
[๋ฐฑ์ค][Node.js] 1316๋ฒ : ๊ทธ๋ฃน ๋จ์ด ์ฒด์ปค (0) | 2021.06.19 |
[๋ฐฑ์ค][Node.js] 1110๋ฒ : ๋ํ๊ธฐ ์ฌ์ดํด (0) | 2021.06.18 |
[๋ฐฑ์ค][Node.js] 1271๋ฒ : ์์ฒญ๋ ๋ถ์2 (0) | 2021.06.17 |
๋๊ธ