将一个n元一维向量向左翻转i个位置的算法（二）

def reverseArr2[T](n:Int, arr:Array[T])={def inverseVector[S](start:Int, end: Int,arr:Array[S])={val pair = (end - start)/2val sum = start + end - 1var j = startfor (i <- 1 to pair){val t = arr(j)arr(j) = arr(sum - j)arr(sum - j) = tj += 1}arr}inverseVector(0,n,arr)inverseVector(n,arr.size,arr)inverseVector(0,arr.size,arr)}