Longest common substring: Difference between revisions
m
→{{header|jq}}: tidy
(jq) |
m (→{{header|jq}}: tidy) |
||
Line 213:
def set(i;j; value):
'''Longest Common Substring''':
Line 225 ⟶ 224:
reduce range(0; b|length) as $j
(.;
if a[$i:$i+1] == b[$j:$j+1] then
(if $i == 0 or $j == 0 then
else
end) as
|
| if $x > .[1]
| .[2] = a[1
else .
end
| |||