swift-algorithms
advent-of-code-2022
swift-algorithms | advent-of-code-2022 | |
---|---|---|
26 | 17 | |
5,708 | 3 | |
0.6% | - | |
6.4 | 10.0 | |
8 days ago | over 1 year ago | |
Swift | Rust | |
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
- 2015-2022: What solution to a problem are you the most proud of
-
[2021 Day 6 (Part 2)] [Rust] Pretty darn elegant
nice one! you can make it even faster by creating a compile time multiplication table as i have done here, so all that happens at runtime is the bucketing of similarly aged fish, 7 multiplications + a sum
- -🎄- 2022 Day 22 Solutions -🎄-
- -🎄- 2022 Day 21 Solutions -🎄-
-
[2022 Day 14 (Part 2)] Oʰ(N²)ᵒᵒᵒᵒ!... OH YEAH!
you've still got some overhead in your code, my rust solution creates a dense lookup array at runtime & takes ~200us on my 10850k. are you including file IO and printing to stdout?
- -🎄- 2022 Day 14 Solutions -🎄-
- -🎄- 2022 Day 13 Solutions -🎄-
-
-🎄- 2022 Day 11 Solutions -🎄-
code
- -🎄- 2022 Day 7 Solutions -🎄-
-
-🎄- 2022 Day 5 Solutions -🎄-
full solution
What are some alternatives?
v2ray-core - A platform for building proxies to bypass network restrictions.
jmurmel - A standalone or embeddable JVM based interpreter/ compiler for Murmel, a single-namespace Lisp dialect inspired by Common Lisp
swift-evolution - This maintains proposals for changes and user-visible enhancements to the Swift Programming Language.
cl-ppcre - Common Lisp regular expression library
SpringBoot-Labs - 一个涵盖六个专栏:Spring Boot 2.X、Spring Cloud、Spring Cloud Alibaba、Dubbo、分布式消息队列、分布式事务的仓库。希望胖友小手一抖,右上角来个 Star,感恩 1024
aoc - Advent of Code
swift-numerics - Advanced mathematical types and functions for Swift
advent_of_code
spring-boot-demo - 🚀一个用来深入学习并实战 Spring Boot 的项目。
CC-AdventOfCode-2022
CS-Notes - :books: 技术面试必备基础知识、Leetcode、计算机操作系统、计算机网络、系统设计
advent-of-code