kicinio的博客

前几天用chatgpt生成diff算法，配上swift的简洁语法，可以称之为锦上添花。

代码： public func binarySearch<T: Comparable>(_ a: [T], key: T, range: Range<Int>) -> Int? { if range.lowerBound >= range.upperBound { return nil } else { let midIndex = range.lowerBound + (range.upperBound - range.l

代码实现 (包括图，边，点) public class DijkstraEdge<T:Equatable & Hashable>:Equatable { public var from:DijkstraNode<T> public var to:DijkstraNode<T> public var weight:Double public init(weight:Double, from:DijkstraNode<T>

代码实现： public struct Queue<T> { private var data = [T]() public init() {} public mutating func dequeue() -> T? { return data.removeFirst() } public func peek() -> T? { return data.first } p

代码实现： public struct Stack<T> { private var elements = [T]() public init() {} // To pop an element public mutating func pop() -> T? { return self.elements.popLast() } // To push an element into satck.