010_swift_嵌套函数-递归函数，其他内嵌函数

递归

func recursion(n:Int)->Int{
    if(n<=1){
        return 1
    }else{
        return recursion(n: n-1)+recursion(n: n-2)
    }
}
recursion(n: 6)

效果变化图

系统自带函数

2/2
abs(-2)
assert(true)
max(2,3)
max(12,31,23,1,41,24,1)
min(12,312,312,3,213,12,312,3)
//新增分隔符和结尾！
print("123123hasdha","asdad",separator: "----", terminator: "!")
debugPrint("123123","123123")
//
let zeroes=repeatElement("Star", count: 5)

for x in zeroes{
    print(x)
}
var a="swfia"
var b="12312da"
swap(&a,&b)
a
b
type(of:a)
type(of:1)
type(of:1.5)
//仅仅保留三的倍数
for i in (1...10).filter({$0%3==0}){
    print(i)
}
//返回全部乘以三
for i in(1...4).map({$0*3}){
    print(i)
}


//累加 参数0代表初始值
let resulta=(1...4).reduce(0, {$0 + $1})
print(resulta)



let result2=(1...4).reduce(0,+)
print(result2)

let result3=(1...4).reduce(1,+)
print(result3)