uva 839 (Not so mobile)天平 ---递归输入

原创于 2017-03-07 11:24:36 发布 · 293 阅读

0 ·

CC 4.0 BY-SA版权

uva 专栏收录该内容

28 篇文章

订阅专栏

本文介绍了一个使用Java实现的递归算法案例，该算法通过读取输入并利用递归方式解决特定问题。主要关注点在于如何定义递归条件、终止条件及如何在递归过程中更新变量状态。

java的写法

import java.util.Scanner;

public class Main {
	static Scanner scan = new Scanner(System.in);
	public static void main(String[] args) {
		int T = scan.nextInt();
		while(T--!=0){
			if(solve(new M(0))){
				System.out.println("YES");
			}else{
				System.out.println("NO");
			}
			if(T!=0)System.out.println();
		}
	}
	private static boolean solve(M w) {
		M wl = new M(scan.nextInt());
		M dl = new M(scan.nextInt());
		M wr = new M(scan.nextInt());
		M dr = new M(scan.nextInt());
		boolean b1 = true,b2 = true;
		if(wl.value==0)b1 = solve(wl);
		if(wr.value==0)b2 = solve(wr);
		w.value = wl.value+wr.value;
		return b1&&b2&&wl.value*dl.value==wr.value*dr.value;
	}
	
	static class M{
		public int value;
		public M(int value){
			this.value = value;
		}
	}
}