プログラマー|Lv.1練習問題Part.5_JS

フルプールコード 👈🏻 クリックしてGithubに移動

❓ Question 1

📝 My Solution 1

function solution(seoul) {
  var answer;
  return (answer = "김서방은 " + seoul.indexOf("Kim") + "에 있다");
}

結果

❓ Question 2

📝 My Solution 2

function solution(s) {
    let answer = true;
    const newArr = s.split('')
    if (newArr.length === 4 || newArr.length === 6) {
        for (let i = 0; i<newArr.length; i++) {
           if (isNaN(newArr[i]) === true) {
             answer = false
             break;
           }
          answer = true
        }
    } else {
        answer = false
    }
  return answer
}

function solution(s) {
	var regex = /^\d{6}$|^\d{4}$/;
  	return regex.test(s);
}

結果

❓ Question 3

📝 My Solution 3

function solution(s) {
    var answer = '';
    const newArr = s.split('')
    answer = newArr.sort((a,b) => {
        if (a>b) {
            return -1
        } if (a<b) {
            return 1
        } else {
            return 0
        }}).join('')
    return answer;
}

結果

❓ Question 4

📝 My Solution 4

function solution(s){
    var answer = true;
    const newArr = s.split('')
    const pCase = newArr.filter(a => a.toLowerCase().includes('p')).length
    const yCase = newArr.filter(a => a.toLowerCase().includes('y')).length
    
    if (pCase === yCase) {
        answer = true;
    } else {
        answer = false;
    }
    return answer;
}

結果

❓ Question 5

配列の文字列を一定の基準でソート

📝 My Solution 5

function solution(strings, n) {
    let answer = strings.sort((a, b) => {
       if(a[n] > b[n]) return 1;
        if(a[n] < b[n]) return -1;
        if(a[n] === b[n]){
            if(a>b) return 1;
            if(a<b) return -1;
            return 0;
        }
    });
    return answer;
}

sort()関数を使用して問題を解いた.

結果