给我一个二维的整数数组作为参数,我应该接受它并排序。但是排序应该手工完成。排序后,需要对已排序的数组进行转置,并返回转置数组。
Input:[[3, 7, 9],[8, 6, 2],[1, 5, 4]]
Return value:[[1, 4, 7],[2, 5, 8],[3, 6, 9]]
func sortAndTranspose(matrix: [[Int]]) -> [[Int]] {
var isSwapped = true
while isSwapped == true {
isSwapped = false
for index in 1..<matrix.count {
if matrix[index] < matrix[index - 1] {
}
}
}
}
发布于 2019-02-03 16:48:35
这是我的解决办法。我使用flatMap
将矩阵转换为数组,然后使用找到in this answer的代码对数组进行排序。一旦完成,我就把数组分解成一个矩阵。
更新版使我们成为swapAt
,支持的不仅仅是正方形格式。感谢@Rob的帮助。
func sortAndTranspose(matrix: [[Int]]) -> [[Int]] {
var array = matrix.flatMap({ $0 }) //create single row array
//manual sorting
for i in stride(from: array.count-1, to: 0, by: -1) {
for j in 1...i {
if array[j-1] > array[j] {
array.swapAt(j, j - 1)
}
}
}
//transpose sorted array back into 2D array
var result = [[Int]]()
let count = matrix[0].count
for i in 0..<array.count {
if (i < count) {
result.append([array[i]])
} else {
result[i % count].append(array[i])
}
}
原始答案
func sortAndTranspose(matrix: [[Int]]) -> [[Int]] {
var array = matrix.flatMap({ $0 }) //create single row array
//manual sorting
for i in stride(from: array.count-1, to: 0, by: -1) {
for j in 1...i {
if array[j-1] > array[j] {
let tmp = array[j-1]
array[j-1] = array[j]
array[j] = tmp
}
}
}
//transpose sorted array back into 2D array
var result = [[Int]]()
let count = matrix.count
for i in 0..<array.count {
if (i < count) {
result.append([array[i]])
} else {
result[i % count].append(array[i])
}
}
https://stackoverflow.com/questions/54504846
复制相似问题