有这样一道智力题:“某商店规定:三个空汽水瓶可以换一瓶汽水。小张手上有十个空汽水瓶,她最多可以换多少瓶汽水喝?”答案是5瓶,方法如下:先用9个空瓶子换3瓶汽水,喝掉3瓶满的,喝完以后4个空瓶子,用3个再换一瓶,喝掉这瓶满的,这时候剩2个空瓶子。然后你让老板先借给你一瓶汽水,喝掉这瓶满的,喝完以后用3个空瓶子换一瓶满的还给老板。如果小张手上有n个空汽水瓶,最多可以换多少瓶汽水喝?
注意: while(in.hasNext()){}一定要有。
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
while(in.hasNext()){
int n = in.nextInt();
System.out.println(getMaxWaterNum(n));
}
}
public static int getMaxWaterNum(int n){
if(n<=1){
return 0;
}
int m = 0;
while(n>=2){
if(n==2){
m+=1;
n = 0;
}else{
m+=n/3;
n = n/3+n%3;
}
}
return m;
}
}
思路二:递归
递归问题
3个瓶子换1瓶水+1个空瓶子,两个瓶子换1瓶水+0个空瓶子,1个瓶子换0瓶水。
f(1) = 0
f(2) = 1
f(3) = 1
f(4) = f(2)+1 //4个瓶子,其中3个可以换1瓶水+1个空瓶,所以是f(2)+1
f(5) = f(3)+1 //3个瓶子换1瓶水+1个空瓶,所以是f(3)+1
…
f(n) = f(n-2)+1
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
while(in.hasNext()){
int n = in.nextInt();
if(n==0){
break;
}else{
System.out.println(getMaxWaterNum(n));
}
}
}
public static int getMaxWaterNum(int n){
if(n<=1){
return 0;
}
if(n==2){
return 1;
}
return getMaxWaterNum(n-2)+1;
}
}
思路三:动态规划
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
while(in.hasNext()){
int n = in.nextInt();
if(n==0){
break;
}else{
int[] dp =new int[n];
dp[0] = 0;
dp[1] = 1;
for(int i =2;i<n;i++){
dp[i] = dp[i-2]+1;
}
System.out.println(dp[n-1]);
}
}
}
}