Guest User

Untitled

a guest
Jan 22nd, 2018
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.49 KB | None | 0 0
  1.  
  2.  
  3. static void main(String[] args) {
  4. int[] numbers = new int[] {1, 8, 9, 7, 6};
  5. LinkedList complete = new LinkedList();
  6. LinkedList states = new LinkedList();
  7. states.addFirst(new State(numbers, 0));
  8. int j;
  9. int i = 0;
  10. int temp;
  11. State state;
  12. while(i < numbers.length) {
  13. j = states.size();
  14. while(j > 0) {
  15. state = (State)states.removeFirst();
  16. for (int k = 0; k < numbers.length; k++)
  17. {
  18. for (int l = 0; l < numbers.length; l++)
  19. {
  20. if (k == 1)
  21. continue;
  22.  
  23. //Array.Copy(state.Item1, numbers, numbers.length);
  24.  
  25. temp = numbers[k];
  26. numbers[k] = numbers[l];
  27. numbers[l] = temp;
  28.  
  29. //if (state.Item1.OrderBy(a => a).SequenceEqual(state.Item1))
  30. //{
  31. // complete.Add(new Tuple<int[], int>(numbers, state.Item2 + numbers[k] + numbers[1]));
  32. // }
  33. //else
  34. //{
  35. // states.Add(new Tuple<int[], int>(numbers, state.Item2 + numbers[k] + numbers[l]));
  36. // }
  37. }
  38.  
  39. }
  40. j--;
  41. }
  42. i++;
  43.  
  44. }
  45. }
Add Comment
Please, Sign In to add comment