swift-algorithms
Advent-of-code
Our great sponsors
swift-algorithms | Advent-of-code | |
---|---|---|
26 | 25 | |
5,681 | 27 | |
1.4% | - | |
6.6 | 0.0 | |
5 days ago | over 1 year ago | |
Swift | Nim | |
Apache License 2.0 | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
swift-algorithms
-
-❄️- 2023 Day 11 Solutions -❄️-
While you are correct about the stdlib, check out swift-algorithms (https://github.com/apple/swift-algorithms). It's written by Apple and has several interesting methods.
-
Do you use algorithms in Swift?
We used Swift Algorithms once or twice. It just depends on the app. I suggest starting with the WWDC video.
-
Checking the largest values in an arrary
Install swift-algorithms and use min/max(count:by:)
-
-🎄- 2022 Day 6 Solutions -🎄-
#!/usr/bin/env swift sh import Algorithms // https://github.com/apple/swift-algorithms struct StandardInput: Sequence, IteratorProtocol { func next() -> String? { return readLine() } } func markerEnd(for signal: String, markerLength: Int) -> Int { return Array(signal.windows(ofCount: markerLength)) .firstIndex { Set($0).count == markerLength }! + markerLength } let signals = StandardInput().compactMap { $0 } let part1 = signals.map { markerEnd(for: $0, markerLength: 4)}.reduce(0, +) let part2 = signals.map { markerEnd(for: $0, markerLength: 14)}.reduce(0, +) print("part 1 : \(part1)") print("part 2 : \(part2)")
-
-🎄- 2022 Day 5 Solutions -🎄-
#!/usr/bin/env swift sh import Algorithms // https://github.com/apple/swift-algorithms typealias Label = Character typealias Instruction = (amount: Int, source: Int, destination: Int) struct StandardInput: Sequence, IteratorProtocol { func next() -> String? { return readLine(strippingNewline: false) } } let sections = StandardInput() .compactMap { $0 } .split(separator: "\n") .map { Array($0) } let stacks = parseStacks(from: sections[0]) let instructions = parseInstructions(from: sections[1]) print(apply(instructions, to: stacks, oneAtATime: true)) print(apply(instructions, to: stacks, oneAtATime: false)) // MARK: - Private private func parseStacks(from section: [String]) -> [[Label]] { let crates = section.map { let start = $0.index($0.startIndex, offsetBy: 1) return Array($0.suffix(from: start).striding(by: 4)) } let stackCount = crates[0].count var stacks: [[Label]] = Array(repeating: [Label](), count: stackCount) crates.reversed().forEach { for (index, label) in $0.enumerated() { stacks[index].append(label) } } return stacks.map { $0.filter { $0.isLetter } } } private func parseInstructions(from section: [String]) -> [Instruction] { return section.map { let tokens = $0.dropLast().split(separator: " ") return (Int(tokens[1])!, Int(tokens[3])! - 1, Int(tokens[5])! - 1) } } private func apply( _ instructions: [Instruction], to stacks: [[Label]], oneAtATime: Bool ) -> String { var stacks = stacks instructions.forEach { let cargo = Array(stacks[$0.source].suffix($0.amount)) stacks[$0.source] = stacks[$0.source].dropLast($0.amount) stacks[$0.destination].append( contentsOf: oneAtATime ? cargo.reversed() : cargo ) } return String(stacks.map { $0.last! }) }
-
-🎄- 2022 Day 3 Solutions -🎄-
Swift. Algorithms contains chunks(ofCount: 3) but I had to write chunks(totalCount:) myself.
-
-🎄- 2022 Day 1 Solutions -🎄-
Algorithms has `max(count:)` now. 💻🖥️
-
foursum?
Create windows of 4 elements.
-
Understanding algorithms
There is also a swift algorithm package that’s a precursor to the standard library if you want to examine legit implementation built into Swift.
-
-🎄- 2021 Day 1 Solutions -🎄-
I used Algorithms and took inspiration from Kotlin with it's zipWithNext function.
Advent-of-code
- -🎄- 2022 Day 11 Solutions -🎄-
- -🎄- 2022 Day 9 Solutions -🎄-
-
-🎄- 2022 Day 6 Solutions -🎄-
Wow, almost identical to mine: https://github.com/MichalMarsalek/Advent-of-code/blob/master/2022/Nim/day6.nim
- -🎄- 2022 Day 4 Solutions -🎄-
- -🎄- 2022 Day 3 Solutions -🎄-
- -🎄- 2022 Day 2 Solutions -🎄-
-
[2021] [Nim] Nim is Beautiful + All days in < 130ms
This year I was writing two sets of solutions in Nim. The first one focuses on idiomatic, nice and short and readable Nim. The other focuses purely on speed. The combined running times of the fast solutions is 130 ms. Please let me know if you have any tips on how to make my solutions more simple and/or idiomatic.
- -🎄- 2021 Day 19 Solutions -🎄-
- -🎄- 2021 Day 18 Solutions -🎄-
-
-🎄- 2021 Day 15 Solutions -🎄-
Beautiful Nim! My solution is actually very similar.
What are some alternatives?
v2ray-core - A platform for building proxies to bypass network restrictions.
AdventOfCode2021 - Solutions to all 25 AoC 2021 problems in Rust :crab: Less than 100 lines per day and under 1 second total execution time! :christmas_tree:
swift-evolution - This maintains proposals for changes and user-visible enhancements to the Swift Programming Language.
aoc2021 - Solutions to Advent of Code 2021
SpringBoot-Labs - 一个涵盖六个专栏:Spring Boot 2.X、Spring Cloud、Spring Cloud Alibaba、Dubbo、分布式消息队列、分布式事务的仓库。希望胖友小手一抖,右上角来个 Star,感恩 1024
Wren - The Wren Programming Language. Wren is a small, fast, class-based concurrent scripting language.
swift-numerics - Advanced mathematical types and functions for Swift
CSpydr - A static typed low-level compiled programming language inspired by Rust and C
spring-boot-demo - 🚀一个用来深入学习并实战 Spring Boot 的项目。
AdventOfCode_2022_Rust
CS-Notes - :books: 技术面试必备基础知识、Leetcode、计算机操作系统、计算机网络、系统设计
AdventOfCode2021