Timeline for I don't like change!
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2017 at 20:56 | history | edited | Arnauld | CC BY-SA 3.0 | saved 1 byte |
| Oct 5, 2017 at 20:42 | history | edited | Arnauld | CC BY-SA 3.0 | saved 24 bytes |
| Oct 5, 2017 at 19:02 | history | edited | Arnauld | CC BY-SA 3.0 | saved 4 bytes |
| Oct 5, 2017 at 18:49 | history | edited | Arnauld | CC BY-SA 3.0 | minor update |
| Oct 5, 2017 at 18:31 | history | edited | Arnauld | CC BY-SA 3.0 | minor update |
| Oct 5, 2017 at 17:27 | history | edited | Arnauld | CC BY-SA 3.0 | added example matrices |
| Oct 5, 2017 at 16:21 | history | edited | Arnauld | CC BY-SA 3.0 | saved 6 bytes |
| Oct 5, 2017 at 15:43 | comment | added | Arnauld | @KevinCruijssen I saved 5 bytes by taking your idea a step further. Thanks! | |
| Oct 5, 2017 at 15:36 | history | edited | Arnauld | CC BY-SA 3.0 | saved 5 bytes |
| Oct 5, 2017 at 15:21 | comment | added | Kevin Cruijssen | Same change I suggested to save 1 byte regarding -1/+1 of j and x still applies to your latest edit: b=>a=>{m=[];x=a.length;y=b.length+1;for(i=y;i--;)m[i]=[[i,'R'.repeat(i)]];for(j=x+1;j--;)m[i=0][j]=[j,'A'.repeat(j)];for(;++i<y;)for(j=-1;++j<x;)R=m[S=(X=m[i-1][j])[0],I=(Y=m[i][j])[0],D=(Z=m[i-1][j+1])[0],Q=[D+1,Z[1]+'R'],i][j+1]=b[i-1]==a[j]?[S,X[1]+' ']:S<I?D<S?Q:[S+1,X[1]+'M']:D<I?Q:[I+1,Y[1]+'A'];return[(g=s=>R[1].replace(/./g,c=>c==s?' ':b[i++],i=0))('A'),g('R',b=a),R[1]]} :) | |
| Oct 5, 2017 at 15:15 | history | edited | Arnauld | CC BY-SA 3.0 | saved 3 bytes / added a formatted version |
| Oct 5, 2017 at 14:51 | history | edited | Arnauld | CC BY-SA 3.0 | saved 28 bytes |
| Oct 5, 2017 at 14:26 | history | answered | Arnauld | CC BY-SA 3.0 |