Swift.二叉树的前序遍历

import Foundation class MyTreeNodeSolution { //递归 func preorderTraversal(_ root: TreeNode?,_ n: inout [Int]) { if root == nil { return } ...

LeetCode 2015-05-24 PM 445次 0条

Swift.选择排序

import Foundation class SelectSortSolution { func sort(_ n: [Int]) -> [Int] { var s = n for i in 0..<s.count { let j =...

LeetCode 2015-05-23 PM 403次 0条

import Foundation class QuickSortSolution { func sort(_ n: [Int]) -> [Int] { var s = n quickSort(&s, 0, n.count - 1) return s } func quickS...

LeetCode 2015-05-22 PM 363次 0条

import Foundation class MergeSortSolution { func sort(_ n: [Int]) -> [Int] { var s = n sortArray(&s, 0, n.count - 1) return s } func sortAr...

LeetCode 2015-05-21 PM 461次 0条

import Foundation class InsertSortSolution { func sort(_ n: [Int]) -> [Int] { var nums = n for i in 0..<nums.count { var j = i while j-1&...

LeetCode 2015-05-19 PM 411次 0条