Skip to content
Snippets Groups Projects
Commit c69c2624 authored by Guillaume Melquiond's avatar Guillaume Melquiond
Browse files

Fix invalid html.

parent 6f496754
Branches
No related tags found
No related merge requests found
...@@ -16,13 +16,13 @@ numbers instead of cards. If the input sequence is 9, 7, 10, 9, 5, 4, ...@@ -16,13 +16,13 @@ numbers instead of cards. If the input sequence is 9, 7, 10, 9, 5, 4,
and 10, then the stacks develop as and 10, then the stacks develop as
{h <pre>} {h <pre>}
<[[9]]> &lt;[[9]]&gt;
<[[7, 9]]> &lt;[[7, 9]]&gt;
<[[7, 9]], [[10]]> &lt;[[7, 9]], [[10]]&gt;
<[[7, 9]], [[9, 10]]> &lt;[[7, 9]], [[9, 10]]&gt;
<[[5, 7, 9]], [[9, 10]]> &lt;[[5, 7, 9]], [[9, 10]]&gt;
<[[4, 5, 7, 9]], [[9, 10]]> &lt;[[4, 5, 7, 9]], [[9, 10]]&gt;
<[[4, 5, 7, 9]], [[9, 10]], [[10]]> &lt;[[4, 5, 7, 9]], [[9, 10]], [[10]]&gt;
{h </pre>} {h </pre>}
Verify the claim is that the number of stacks at the end of the game Verify the claim is that the number of stacks at the end of the game
......
...@@ -46,7 +46,7 @@ public class Relaxed { ...@@ -46,7 +46,7 @@ public class Relaxed {
public static boolean isRelaxedPrefix(int[] pat, int[] a) { public static boolean isRelaxedPrefix(int[] pat, int[] a) {
int shift = 0; int shift = 0;
for(int i=0; i<pat.length; i++) { for(int i=0; i&lt;pat.length; i++) {
if (pat[i]!=a[i-shift]) if (pat[i]!=a[i-shift])
if (shift==0) shift=1; if (shift==0) shift=1;
else return false; else return false;
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment