Content deleted Content added
m Δ |
m →Step 3: split subsection |
||
Line 209:
The aforementioned detailed description is ''just one way'' to draw the minimum number of lines to cover all the 0s. Other methods work as well.
'''From the elements that are left, find the lowest value. Subtract this from every unmarked element and add it to every element covered by two lines.'''
| |||