Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 12 additions & 2 deletions prob1.js
Original file line number Diff line number Diff line change
@@ -1,7 +1,17 @@
//1. 함수 로직 작성 문제

function solution(num, total) {
let answer = [];

return answer;

//배열의 중앙 인덱스의 값임
let mNum= total/num;
let firstNum = mNum-((num-1)/2) //짝수개

let answer = [];

for(i=0;i<num;i++){
answer[i] = firstNum;
firstNum++;
}
return answer;
}
7 changes: 6 additions & 1 deletion prob2.js
Original file line number Diff line number Diff line change
@@ -1,6 +1,11 @@
//2. map활용 문제
const numbers = [1, 2, 3, 4, 5];

let answer;
let answer =[];


answer = numbers.map(function(num){
return num%2===0?"짝수":"홀수";
});
console.log(answer);

36 changes: 35 additions & 1 deletion prob3.js
Original file line number Diff line number Diff line change
Expand Up @@ -7,13 +7,47 @@ let likelion = [

// 1번 문제 코드작성


console.log("1번문제");

for(let i=0;i<likelion.length-1;i++){
for(let j=i+1;j<likelion.length;j++){
if(likelion[i].age > likelion[j].age){
let temp = likelion[i];
likelion[i]=likelion[j];
likelion[j]=temp;
}
}
}
console.log(likelion);



// 2번 문제 코드작성

console.log("2번문제");
let result2 = [];

console.log(result2);
for(let i=0;i<likelion.length;i++){
if(likelion[i].age >=24){
result2 = likelion[i];
console.log(result2);
}
}





// 3번 문제 코드작성
console.log("3번문제")
let targetName = "전수빈";
let result3 = null;

for(let i=0;i<likelion.length;i++){
if(likelion[i].name === targetName){
result3 = likelion[i].part;
}
}

console.log(result3);