correctTail.js (8kyu 85)

05 Mar 2019 in about Dev on Algorithm

Codewars 알고리즘 풀이

Problem

You must correct the broken function to make sure that the second argument(tail), is the same as the last letter of the first argument(body).
- 두 번째 인수(tail)가 첫 번째 인수(body)의 마지막 문자와 동일한지 확인한다.

Solution 01

function correctTail(body, tail) {
  if (body[body.length] - 1 === tail) {
    return true;
  } else {
    return false;
  }
}

correctTail('Fox', 'x');      // true
correctTail('Fox', 'a');      // false
correctTail('Meerkat', 't');  // true
correctTail('Meerkat', 'a');  // false

Solution 02

function correctTail(body, tail) {
  return body[body.length - 1] === tail;
}

correctTail('Fox', 'x');      // true
correctTail('Fox', 'a');      // false
correctTail('Meerkat', 't');  // true
correctTail('Meerkat', 'a');  // false

Solution 03

function correctTail(body, tail) {
  return body.slice(-1) === tail;
}

correctTail('Fox', 'x');      // true
correctTail('Fox', 'a');      // false
correctTail('Meerkat', 't');  // true
correctTail('Meerkat', 'a');  // false

slice() 메소드
선택한 element를 새 배열로 반환한다.