Advertisement
Guest User

Untitled

a guest
Feb 24th, 2017
72
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.26 KB | None | 0 0
  1. HashMap<String,Integer> map = new HashMap<String,Integer>();
  2. for(int i=0;i<bank.length;i++)
  3. {
  4. map.put(bank[i],i);
  5.  
  6. }
  7.  
  8. int len = start.length();
  9. int le=0;
  10.  
  11. Character[] choices={'A','C','T','G' };
  12. char[] temp;
  13.  
  14. Queue<String> Q = new LinkedList<String>();
  15. Queue<Integer> level = new LinkedList<Integer>();
  16.  
  17. Q.add(start);
  18. level.add(le);
  19.  
  20. while(!Q.isEmpty())
  21. {
  22. String test1=Q.remove();
  23. String test2=test1;
  24. le=level.remove();
  25.  
  26. if(test1.equals(end))
  27. {
  28.  
  29. return le;
  30. }
  31.  
  32. le++;
  33.  
  34. for(int j=0;j<len;j++)
  35. {
  36. for(Character c:choices)
  37.  
  38. {
  39. if(c==(test1.charAt(j)))
  40. {
  41. continue;
  42.  
  43. }
  44. else
  45. {
  46.  
  47. temp=test1.toCharArray();
  48. temp[j]=c;
  49. test1=new String(temp);
  50.  
  51.  
  52. if(map.containsKey(test1))
  53.  
  54. {
  55. System.out.println(test1);
  56.  
  57. Q.add(test1);
  58. level.add(le);
  59.  
  60. }
  61.  
  62.  
  63. }
  64.  
  65.  
  66. }
  67.  
  68.  
  69.  
  70. test1=test2;
  71. }
  72.  
  73. }
  74.  
  75. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement