hav

Untitled

hav
Mar 23rd, 2012
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.18 KB | None | 0 0
  1. for (i = 0 ; i <= L.length, i++):
  2. int j = 0;
  3. while j <= L.length:
  4. if i == j
  5. j++
  6. else if L[i] == L[j]
  7. return;
  8. else
  9. j++;
  10.  
  11. if i == L.length:
  12. return "Success!";
Advertisement
Add Comment
Please, Sign In to add comment