swift-algorithms
AdventOfCode2021.jl
Our great sponsors
swift-algorithms | AdventOfCode2021.jl | |
---|---|---|
26 | 28 | |
5,676 | 17 | |
1.3% | - | |
6.6 | 6.6 | |
7 days ago | 10 days ago | |
Swift | Julia | |
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.
AdventOfCode2021.jl
-
[2021 All days][Rust] Write-up and thoughts on the 7th edition of Advent of Code
I've also tried to write pretty efficient code for the 2021 Advent of Code challenge, but in Julia (https://github.com/goggle/AdventOfCode2021.jl). I would like to run your benchmarks on my local machine. Any chance you could help me (I'm a rust noob...)?
-
[2021, all days] [Julia] After having improved my solutions during the last days, I'm happy to share my repository with you! All days combined run in under 750 ms. Every solution is written in Julia.
Link to the repository: https://github.com/goggle/AdventOfCode2021.jl
- -🎄- 2021 Day 25 Solutions -🎄-
- -🎄- 2021 Day 24 Solutions -🎄-
- -🎄- 2021 Day 23 Solutions -🎄-
- -🎄- 2021 Day 22 Solutions -🎄-
- -🎄- 2021 Day 21 Solutions -🎄-
- -🎄- 2021 Day 20 Solutions -🎄-
- -🎄- 2021 Day 19 Solutions -🎄-
- -🎄- 2021 Day 18 Solutions -🎄-
What are some alternatives?
v2ray-core - A platform for building proxies to bypass network restrictions.
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
swift-evolution - This maintains proposals for changes and user-visible enhancements to the Swift Programming Language.
aoc2021 - Advent of Code 2021 Solutions
spring-boot-demo - 🚀一个用来深入学习并实战 Spring Boot 的项目。
adventofcode - Advent of Code challenge solutions
swift-numerics - Advanced mathematical types and functions for Swift
aoc2021 - My solutions to Advent of Code 2021.
CS-Notes - :books: 技术面试必备基础知识、Leetcode、计算机操作系统、计算机网络、系统设计
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
SpringBoot-Labs - 一个涵盖六个专栏:Spring Boot 2.X、Spring Cloud、Spring Cloud Alibaba、Dubbo、分布式消息队列、分布式事务的仓库。希望胖友小手一抖,右上角来个 Star,感恩 1024
Advent-of-Code - Advent of Code