Advertisement
Guest User

AP Practice Arthur Hu

a guest
Apr 26th, 2019
107
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 2.65 KB | None | 0 0
  1. /*
  2.  
  3. 01. d
  4. 02. b
  5. 03. c
  6. 04. a
  7. 05. e
  8. 06. e
  9. 07. b
  10. 08. c
  11. 09. b
  12. 10. d a
  13. 11. c
  14. 12. b
  15. 13. a
  16. 14. b a
  17. 15. e
  18. 16. c
  19. 17. b a
  20. 18. e
  21. 19. a
  22. 20. a e
  23. 21. d
  24. 22. b e
  25. 23. d
  26. 24. e
  27. 25. a
  28. 26. c
  29. 27. d
  30. 28. b
  31. 29. a
  32. 30. a
  33. 31. a
  34. 32. c
  35. 33. e
  36. 34. d
  37. 35. e
  38. 36. c
  39. 37. b
  40. 38. a
  41. 39. e
  42. 40. d
  43. */
  44. //1a
  45.  
  46.     int[] asdf = new int[arr.length];
  47.     for (int i = 0, j = arr.length - 1; i < arr.length; i++, j--)
  48.         asdf[i] = arr[j];
  49.  
  50.     for (int i = 0; i < arr.length; i++)
  51.         arr[i] = asdf[i];
  52.  
  53. //1b
  54.    
  55.     for (int[] row: mat)
  56.         ArrayUtil.reverseArray(row);
  57.  
  58. //1c
  59.  
  60.     int[][] asdf = new int[mat.length][];
  61.     for (int i = 0, j = mat.length - 1; i < mat.length; i++, j--)
  62.         asdf[i] = mat[j];
  63.  
  64.     for (int i = 0; i < mat.length; i++)
  65.         mat[i] = asdf[i];
  66.     this.reverseAllRows();
  67.  
  68. //2a
  69. public List<Integer> getBlankPositions(){
  70.     List<Integer> posList = new ArrayList<Integer>();
  71.     for (int i = 0; i < sentence.length(); i++)
  72.         if (sentence.substring(i, i + 1).equals(" "))
  73.             posList.add(i);
  74.     return posList
  75. }
  76. //2b
  77. public int countWords(){
  78.     return getBlankPositions().size() + 1;
  79. }
  80. //2c
  81. public String[] getWords(){
  82.     List<Integer> posList = getBlankPositions;
  83.     int numWords = countWords();
  84.     String[] wordArr = new String[numWords];
  85.     for (int i = 0; i < numWords; i++){
  86.         if (i == 0){
  87.             if (posList.size() != 0)
  88.                 wordArr[i] = sentence.substring(0, posList.get(0));
  89.             else
  90.                 wordArr[i] = sentence;
  91.         }
  92.         else if (i == posList.size())
  93.             wordArr[i] = sentence.substring(posList.get(i-10));
  94.         else
  95.             wordArr[i] = sentence.substring(posList.get(i-1), posList.get(i))
  96.     }
  97.     return wordArr
  98. }
  99.  
  100. //3a
  101. public Player requestSlot(String playerName){
  102.     for (int i = 0; i < slots.length; i++){
  103.         if (slots[i] == null){
  104.             Player p = new Player(playerName, i);
  105.             slots[i] = p;
  106.             return p;
  107.         }
  108.     }
  109.     waitingList.add(playerName);
  110.     return null;
  111. }
  112. //3b
  113. public Player cancelAndReassignSlot(Player p) {
  114.     int i = p.getPlayerNumber();
  115.     if (waitingList.size() != 0) {
  116.         slots[i] = new Player(waitingList.get(0), i);
  117.         waitingList.remove(0);
  118.     }
  119.     else {
  120.         slots[i] = null;
  121.     }
  122.     return slots[i];
  123. }
  124.  
  125. //4a
  126. public void reset() {
  127.     if(arm.isFacingRight())
  128.         arm.changeDirection();
  129.     arm.moveForward(arm.getCurrentIndex());
  130.     arm.changeDirection();
  131. }
  132. //4b
  133. public int mostAcidic() {
  134.     reset();
  135.     int minPH = Integer.MAX_VALUE;
  136.     int minIndex = 0;
  137.     int index = 0;
  138.     while (index < solutions.get(index)) {
  139.         Solution s = solutions.get(index);
  140.         if (s.getPH() < minPH){
  141.             minPH = s.getPH;
  142.             minIndex = index;
  143.         }
  144.         index++;
  145.     }
  146.     if (minPH < 7)
  147.         return -1;
  148.     else{
  149.         arm.moveForward(minIndex);
  150.         return minIndex;
  151.     }
  152. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement