This commit is contained in:
Markus Brueckner 2024-12-03 22:05:19 +01:00 committed by GitHub
parent 03ae833906
commit a8df580730

View file

@ -4,7 +4,7 @@ Slightly upping the complexity, at least if you don't want to go the brute force
Again reading a CSV, this time without a specified fixed amount of columns. The interesting bit is, Again reading a CSV, this time without a specified fixed amount of columns. The interesting bit is,
that we're not so much working with the numbers, but rather their differences, so we're basically in that we're not so much working with the numbers, but rather their differences, so we're basically in
for a instance of the [fencepost error](https://en.wikipedia.org/wiki/Off-by-one_error) if we get it for an instance of the [fencepost error](https://en.wikipedia.org/wiki/Off-by-one_error) if we get it
wrong. Hooray, I guess... wrong. Hooray, I guess...
## Task 1 ## Task 1
@ -33,4 +33,4 @@ task 1 to make it valid again. In th end I tried 4 approaches:
This ensures, that we're catching this last corner-case. It catches all corner-cases in the given input (and I This ensures, that we're catching this last corner-case. It catches all corner-cases in the given input (and I
can't think of a case it would miss) and it is more efficient than solution 2. Solution is _O(n*m)_ for _n_ being the number can't think of a case it would miss) and it is more efficient than solution 2. Solution is _O(n*m)_ for _n_ being the number
of total series and _m_ being the average length of a series. This solution is _O(n)_, since it turns the element removal of total series and _m_ being the average length of a series. This solution is _O(n)_, since it turns the element removal
step into an _O(1)_ operation. step into an _O(1)_ operation.