Algorithm-Monkey Move banana

Algorithm-Monkey Move bananaJanuary 28, 2018 19:59:15Number of readings:Problem Description:

There are 100 bananas on the edge of a small monkey, it will take 50 meters to get home, each time it moves up to 50 bananas. It will eat a root every 1 meters, how many bananas it can move to the home?

Tip: He can put the banana down for a round trip, but must make sure it has bananas to eat every metre of the walk. can also go to n meters, put down some bananas, take the N Banana walk back to move 50.

Program implementation:

Interface:

2. public Interface Monkeysmovebananas {
6. /**
8. *
10. * Total number of @param num
12. * @param maxnum The maximum number of moves such as 50 each
14. * @param distance distance
16. * @param eatnum per metre of food, such as 1 .
18. *
20. * @return The remaining quantity in the home, or the quantity remaining when the banana cannot be moved
22. *
24. */
26. int Move(int num, int maxnum, int distance, int eatnum);
28. }

Implementation class:

2. /**
4. * @category monkeys to move bananas.
6. * @author song
8. */
10. public class Monkeysmovebananasimpl implements Monkeysmovebananas {
14. /**
16. *
18. * Total number of @param num
20. * @param maxnum The maximum number of moves such as 50 each
22. * @param distance distance
24. * @param eatnum per metre of food, such as 1 .
26. *
28. * @return The remaining quantity in the home, or the quantity remaining when the banana cannot be moved
30. *
32. */
34. @Override
36. Public int Move(int num, int maxnum, int distance, int eatnum) {
40. / * has moved to the location, that is, moved a few meters * *
42. int location = 0;
46. / * The number of points left at the start of each handling * *
48. int currentnumbers = num;
52. / * Quantity left at each end of handling * /
54. int currentnumbere = 0;
58. / * Outer loop once, i.e. move all remaining bananas one position * /
60. While (location < distance && Currentnumbers > Eatnum) {
62. System.out.println ("Current position" + location + "with" + currentnumbers + "banana");
66. / * Inner Loop once, that is, to move the remaining banana one position, is to move a position of the specific details * /
68. While (true) {
72. if (Currentnumbers > Maxnum) {
74. Moveoneposition (location, location+1, Maxnum, eatnum);
76. Currentnumbers-= Maxnum;
78. Currentnumbere + = Maxnum-eatnum;
80. } Else {
82. Moveoneposition (location, location+1, currentnumbers, eatnum);
84. Currentnumbere + = Currentnumbers-eatnum;
86. Currentnumbers = 0;
88. }
92. / * See if you need to move from the beginning to the left, i.e. need not return * /
94. if (currentnumbers >= eatnum * 2) {
96. Moveoneposition (location+1, location,-1, eatnum);
98. Currentnumbere-= Eatnum;
100. } Else {
102. Break ;
104. }
106. }
110. Currentnumbers = Currentnumbere;
112. Currentnumbere = 0;
114. Location + +;
116. }
120. System.out.println ("remainder" + currentnumbers + "one");
122. return currentnumbers;
124. }
128. /**
130. *
132. * @param from start position
134. * @param to target location
136. * number of @param numbers moved
138. * @param eatnum to move one metre to eat the quantity
140. */
142. private void moveoneposition(int from, int to, int number, int eatnum) {
144. if (number! =-1) {
146. System.out.println ("+from +" position "+ number + " to "+ to + " position, consumption "+ Eatnum + ");
148. } Else {
150. System.out.println ("+ from +" position back "+ to + " position, consumption "+ Eatnum + ");
152. }
154. }
156. }

Test class:

2. public class monkeysmovebananastest {
6. private static Monkeysmovebananas Monkeysmovebananas = null;
10. @BeforeClass
12. Public static void setupbeforeclass() throws Exception {
14. Monkeysmovebananas = new Monkeysmovebananasimpl ();
16. }
20. @Test
22. Public void movetest() {
24. int k = monkeysmovebananas.move ( 1);
26. Assertequals (k, + );
30. K = Monkeysmovebananas.move (+, 2);
32. Assertequals (k );
34. }
36. }

Algorithm-Monkey Move banana