今天呢,写一个青蛙的约会,难点在于如果两个青蛙不会相遇,则怎样来确定他们不会相遇。我的解决办法是,定义一个数组,不断地记录两只青蛙各自的位置,如果有一次,两个都会和上次的位置重合时,则永远不会相遇。
题目连接为:https://www.nowcoder.com/questionTerminal/b23fe752b4e945b79e45a2d1731a21c4
具体实现:
import java.util.Scanner;
public class 乐观的青蛙 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scanner = new Scanner(System.in);
int x = scanner.nextInt();//输入起始位置
int y = scanner.nextInt();
int m = scanner.nextInt();//输入每次能跳多少
int n = scanner.nextInt();
int l = scanner.nextInt();//输入数轴总长
int[] placex = {x}; //定义数组,记录青蛙的每次位置
int[] placey = {y};
int rest = 0;
while(x != y) {
x = (x + m)%l;
y = (y + n)%l;
rest++; //如果相遇,记录跳的次数
placex = swep(placex, x);
placey = swep(placey, y);
for (int i = 0; i < placey.length; i++) {
for (int j = i + 1; j < placey.length; j++) {//判断是否有重合的位置
if(placex[i] == placex[j] && placey[i] == placey[j]) {
System.out.println("Impossible");
return; //程序结束
}
}
}
}
System.out.println(rest);
}
public static int[] swep(int[] args, int x) {
int[] newArrays = new int[args.length + 1];
for (int i = 0; i < args.length; i++){//不断扩充数组,将每次的新位置都加上去
newArrays[i] = args[i];
}
newArrays[args.length] = x;
return newArrays;
}
}