Skip to content

Commit 7346c1f

Browse files
committed
Doc correction
1 parent e641fe7 commit 7346c1f

File tree

2 files changed

+6
-2
lines changed

2 files changed

+6
-2
lines changed

README.md

+5-1
Original file line numberDiff line numberDiff line change
@@ -6,4 +6,8 @@ Originally I thought of fully explaining this to non-Clojurists, but other folks
66
than I. So I'll assume the reader can follow along with a basic understanding of Lisp/Clojure, and I'll try to
77
fill in the blanks when I'm able.
88

9-
_Warning:_ I write long explanations. So... yeah.
9+
_Warning:_ I write long explanations. So... yeah.
10+
11+
| Day # | Source | Blog Post |
12+
| ----- | ------ | --------- |
13+
| 1 | [source](src/advent_2020_clojure/day01.clj) | [blog](docs/day1.md) |

docs/day1.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -208,7 +208,7 @@ Using a thread-last pipeline, we split the input String by line, map each String
208208
value to an Integer, and calculate all permutations of those values given a target
209209
length. The `keep` function says to apply a mapping function and throw away the
210210
nulls, like Kotlin's `mapNotNull`. So here we say when we have a matching tuple,
211-
such that the values are all increasing and add to zero, return the product.
211+
such that the values are all increasing and add to 2020, return the product.
212212
Finally, returning the first (and only?) value calculated.
213213

214214
```clojure

0 commit comments

Comments
 (0)