Nicholas Maccharoli
github.com/nirma
@din0sr
| <?xml version="1.0" encoding="UTF-8"?> | |
| <tal curprogram="0" version="1.1"> | |
| <programs> | |
| <program path="" programname="hole_head" modulation="0.0" dcolfovalue="0.4233498573303223" | |
| dcopwmvalue="0.1031103730201721" dcopwmmode="1.0" dcopulseenabled="1.0" | |
| dcosawenabled="1.0" dcosuboscenabled="1.0" dcosuboscvolume="1.0" | |
| dconoisevolume="0.0" hpfvalue="0.0" filtercutoff="0.473753035068512" | |
| filterresonance="0.4271174967288971" filterenvelopemode="1.0" | |
| filterenvelopevalue="0.09792116284370422" filtermodulationvalue="0.5374104976654053" |
| func maxProfitRodCut(prices: [Int], length: Int) -> Int { | |
| if length <= 0 { | |
| return 0 | |
| } | |
| var currentMax = Int.min | |
| for index in (1...length) { | |
| currentMax = max(currentMax, prices[index - 1] + maxProfitRodCut(prices: prices, length: length - index)) | |
| } | |
| return currentMax | |
| } |
| import Cocoa | |
| class Graph { | |
| let size: Int | |
| private var nodes: [[Int]] | |
| init(size: Int) { |
| ## ---------- File system related ---------- | |
| .DS_Store | |
| ## ---------- Build Related ---------- | |
| build/ | |
| DerivedData | |
| build.xcarchive | |
| *.pbxuser | |
| !default.pbxuser | |
| *.mode1v3 |
| let example: Int = 42 | |
| "This is a conventional string with interpolation: \(example)" | |
| #"This is a raw string with interpolation: \#(example)"# | |
| ##"This is a string with raw pound signs with interpolation \##(example)"## |
| git clone --depth 1 https://github.com/apple/swift.git # a shallow clone will do | |
| mkdir -p ~/.vim # make a vim folder if its not available already | |
| cp -a ./swift/utils/vim/ ~/.vim # just copy over the contents of utils/vim as they are | |
| rm -rf # this is just for cleanup |
| struct CardboardBox: Codable { | |
| let brand: String | |
| let width: Double | |
| let height: Double | |
| let depth: Double | |
| let flavor: String? | |
| } |
| // Insertion Sort | |
| func insertionSort(_ elements: [Int]) -> [Int] { | |
| guard elements.count >= 2, let last = elements.last else { return elements } | |
| var copy = elements | |
| var pivot = last | |
| var idx: Int | |
| for index in 0..<(elements.count - 1) { | |
| idx = index |
| func recursiveFib(position: Int) -> Int { | |
| if position == 0 || position == 1 { | |
| return position | |
| } | |
| return recursiveFib(position: position - 1) + recursiveFib(position: position - 2) | |
| } | |
| func dynamicFib(position: Int) -> Int { | |