Advertisement
natalierey

Untitled

Feb 14th, 2016
54
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.52 KB | None | 0 0
  1. for (int j=0; j<currentTree.getValue().size(); j++)
  2. {
  3. if (currentTree.getValue().get(j).length() == signiture.length())
  4. {
  5. if (!matching.contains(currentTree.getValue().get(j)))
  6. {
  7. matching.add(currentTree.getValue().get(j));
  8. }
  9. }
  10. else if (currentTree.getValue().get(j).length() > signiture.length())
  11. {
  12. if (!matching.contains(currentTree.getValue().get(j)))
  13. {
  14. matching.add(currentTree.getValue().get(j).substring(0, signiture.length()));
  15. }
  16. }
  17. }
  18. return matching;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement