Skip to content

[Leetcode] 14. Longest Common Prefix โ€‹

Problem โ€‹

๋ฌธ์ œ ๋งํฌ

์ฃผ์–ด์ง ๋ฌธ์ž์—ด๋ฐฐ์—ด์—์„œ ๊ณตํ†ต์ ์œผ๋กœ ์‚ฌ์šฉ๋˜๋Š” ๊ฐ€์žฅ ๊ธด ์ ‘๋‘์–ด๋ฅผ ์ฐพ์•„๋ผ.

Solution โ€‹

  1. ์ฒซ๋ฒˆ์งธ ๋ฌธ์ž์—ด์—์„œ ๋‘๋ฒˆ์งธ ๋ฌธ์ž์—ด์„ ๋น„๊ตํ•œ๋‹ค
  2. ์ฒซ๋ฒˆ์งธ ์ธ๋ฑ์Šค๋ถ€ํ„ฐ ์ˆœ์ฐจ์ ์œผ๋กœ ๋™์ผํ•œ ๋ฌธ์ž๋ฅผ ๋ชจ์•„์„œ ๋ˆ„์‚ฐ๊ธฐ์— ์ €์žฅํ•œ๋‹ค.
  3. ๋ˆ„์‚ฐ๊ธฐ์™€ ๊ทธ ๋‹ค์Œ ๋ฌธ์ž์—ด์„ ๋น„๊ตํ•˜๊ณ  2๋ฒˆ ํ–‰๋™์„ ๋ฐ˜๋ณตํ•œ๋‹ค.

JS CODE โ€‹

javascript
/**
 * @param {string[]} strs
 * @return {string}
 */
var longestCommonPrefix = function(strs) {
  return strs.reduce((acc,cur) => {
    let temp = ''
    for(let i = 0; i < acc.length; i++) {
      if (i !== acc.indexOf(cur[i], i)) break
      temp += acc[i]
    }
    return temp
  })
}