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
42 changes: 21 additions & 21 deletions Prob1.playground/Contents.swift
Original file line number Diff line number Diff line change
@@ -1,23 +1,23 @@
//문제1(이 문제 이상하면 풀지 마세요ㅠㅠ)
let numArr1 = [1, 2, 3, 4, 6, 8, 34, 13, 33, 66, 66666, 789]
var retArr1: [Int] = []
var ret1: Int = 0

for i in 0..<numArr1.count{
for j in 0...i{
ret1 += numArr1[j]
}
retArr1[i] = ret1
}
print(retArr1)

//문제2
let numArr2 = [1, 2, 3, 4, 6, 8, 34, 13, 33, 66, 66666, 789]
var ret2: Int = 0
for i in 0..<numArr2.count{
if numArr2[i] % 3 == 0{
// 문제1 이상해요..........

//문제2


let numArr2 = [1, 2, 3, 4, 6, 8, 34, 13, 33, 66, 66666, 789]
var ret2: Int = 0

for i in 0..<numArr2.count{ // total 12

if numArr2[i] % 3 == 0{ // 3 , 6, 33 , 66 , 66666 , 789
ret2 += numArr2[i]
}

}
print(ret2)

}
print(ret2)

let ret = numArr2.filter { (a: Int) -> Bool in return a % 3 == 0 }.reduce(0) { (k, aa) -> Int in return aa + k }


print(ret)


Binary file not shown.
23 changes: 23 additions & 0 deletions Prob1_answer.playground/Contents.swift
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
//문제1(이 문제 이상하면 풀지 마세요ㅠㅠ)
let numArr1 = [1, 2, 3, 4, 6, 8, 34, 13, 33, 66, 66666, 789]
var retArr1: [Int] = []
var ret1: Int = 0

for i in 0..<numArr1.count{
for j in 0...i{
ret1 += numArr1[j]
}
retArr1[i] = ret1
}
print(retArr1)

//문제2
let numArr2 = [1, 2, 3, 4, 6, 8, 34, 13, 33, 66, 66666, 789]
var ret2: Int = 0
for i in 0..<numArr2.count{
if numArr2[i] % 3 == 0{
ret2 += numArr2[i]
}

}
print(ret2)
File renamed without changes.

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

Binary file not shown.
25 changes: 21 additions & 4 deletions Question.playground/Contents.swift
Original file line number Diff line number Diff line change
Expand Up @@ -4,19 +4,36 @@ import UIKit


//입력한 숫자에서 홀수와 짝수로 나눈 후 각 각 새로운 배열로 넣어서 숫자 순으로 배열

var array: [Int] = [1, 2, 5, 7, 13, 12, 8, 20, 33]
var Array1: [Int] = []
var Array2: [Int] = []
for number in array{

if number%2 == 0 {
Array1.append(number)

Array1 += [number]
Array1.sort()
}


else {
Array2 += [number]
func check (number1: Int, number2:Int) -> Bool {
return number1 > number2
}

Array2 += [number]

}
}
let ArrayArray1 = Array1.sorted {$0 < $1}
print(Array1)
print(Array2)



let ArrayArray1 = Array1.filter { (a: Int) -> Bool in return a%2 == 0}.sorted {$0 < $1}
print(ArrayArray1)
let ArrayArray2 = Array2.sorted {$0 < $1}
let ArrayArray2 = Array2.filter { (b: Int) -> Bool in return b%2 != 0}.sorted {$0 < $1}
print(ArrayArray2)


Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

Binary file not shown.
22 changes: 22 additions & 0 deletions Question_answer.playground/Contents.swift
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
//: Playground - noun: a place where people can play

import UIKit


//입력한 숫자에서 홀수와 짝수로 나눈 후 각 각 새로운 배열로 넣어서 숫자 순으로 배열
var array: [Int] = [1, 2, 5, 7, 13, 12, 8, 20, 33]
var Array1: [Int] = []
var Array2: [Int] = []
for number in array{
if number%2 == 0 {
Array1.append(number)
}
else {
Array2 += [number]
}
}
let ArrayArray1 = Array1.sorted {$0 < $1}
print(ArrayArray1)
let ArrayArray2 = Array2.sorted {$0 < $1}
print(ArrayArray2)

4 changes: 4 additions & 0 deletions Question_answer.playground/contents.xcplayground
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<playground version='5.0' target-platform='ios'>
<timeline fileName='timeline.xctimeline'/>
</playground>
24 changes: 0 additions & 24 deletions README.md

This file was deleted.

5 changes: 0 additions & 5 deletions avocado.playground/Contents.swift

This file was deleted.