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
6 changes: 6 additions & 0 deletions prob1.js
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,12 @@

function solution(num, total) {
let answer = [];
let mid = total/num;
let start = mid-(num-1)/2
for(let i =0; i<num;i++){
answer.push(start);
start++;
}

return answer;
}
5 changes: 4 additions & 1 deletion prob2.js
Original file line number Diff line number Diff line change
@@ -1,6 +1,9 @@
//2. map활용 문제
const numbers = [1, 2, 3, 4, 5];

let answer;
let answer = numbers.map(function(element){
if(element%2==0){return "짝수";}
else{return "홀수";}
});

console.log(answer);
26 changes: 23 additions & 3 deletions prob3.js
Original file line number Diff line number Diff line change
Expand Up @@ -4,16 +4,36 @@ let likelion = [
{ name: "전수빈", part: "FE_기획", age: 25 },
{ name: "김예린", part: "FE_홍보", age: 23 },
];

let len = likelion.length;
let n = 0;
// 1번 문제 코드작성

while(n<len){
for(i=1;i<len;i++){
let tmp = likelion[i-1];
if(tmp.age>likelion[i].age){
likelion[i-1] = likelion[i];
likelion[i]=tmp;
}
}
n++;
}
console.log(likelion);
// 2번 문제 코드작성
let result2 = [];
for(i=0; i<len;i++){
if(likelion[i].age>=24){
result2.push(likelion[i]);
}
}

console.log(result2);

// 3번 문제 코드작성
let targetName = "전수빈";
let result3 = null;

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