求“天干地支”算法

0 0

求“天干地支”算法5

已知天干地支，求对应的数值。拒绝查表法，最好有Java代码。
谢谢

如，
已知甲子求得结果 1
已知壬辰求得结果 29

问题补充：

chen_yongkai 写道

我写了个，


import java.util.HashMap;

public class ChineseCalendar {
	private final static HashMap<Character, Integer> Heavenly_Stems = new HashMap<Character, Integer>();
	private final static HashMap<Character, Integer> Earthly_Branches = new HashMap<Character, Integer>();
	static {
		Heavenly_Stems.put('甲', 1);
		Heavenly_Stems.put('乙', 2);
		Heavenly_Stems.put('丙', 3);
		Heavenly_Stems.put('丁', 4);
		Heavenly_Stems.put('戊', 5);
		Heavenly_Stems.put('己', 6);
		Heavenly_Stems.put('庚', 7);
		Heavenly_Stems.put('辛', 8);
		Heavenly_Stems.put('壬', 9);
		Heavenly_Stems.put('癸', 10);

		Earthly_Branches.put('子', 1);
		Earthly_Branches.put('丑', 2);
		Earthly_Branches.put('寅', 3);
		Earthly_Branches.put('卯', 4);
		Earthly_Branches.put('辰', 5);
		Earthly_Branches.put('巳', 6);
		Earthly_Branches.put('午', 7);
		Earthly_Branches.put('未', 8);
		Earthly_Branches.put('申', 9);
		Earthly_Branches.put('酉', 10);
		Earthly_Branches.put('戌', 11);
		Earthly_Branches.put('亥', 12);
	}

	public static int getCode(String name) {
		int n = name.length();
		if (n < 2)
			throw new IllegalArgumentException("Unknown name: " + name);

		char h = name.charAt(0);
		Integer hCode = Heavenly_Stems.get(h);
		if (hCode == null)
			throw new IllegalArgumentException("Unknown name: " + name);
		char e = name.charAt(1);
		Integer eCode = Earthly_Branches.get(e);
		if (eCode == null)
			throw new IllegalArgumentException("Unknown name: " + name);
		hCode%=10;
		eCode%=12;
		for (int c = 1; c <= 60; c++) {
			if (c % 10 == hCode && c % 12 == eCode)
				return c;
		}
		throw new IllegalArgumentException("Unknown name: " + name);
	}

	public static void main(String[] args) {
		System.out.println(getCode("甲子"));
		System.out.println(getCode("壬辰"));
		System.out.println(getCode("癸酉"));
		System.out.println(getCode("癸亥"));
		
	}
}

其实用查表法是最好的

啊，for 循环计算啊。我原预期的直接通过数学计算一步到位的，就像数值推干支那样。不知道有没有呢？

问题补充：终于搞定，在网上找到了相关算法，其实就是“中国剩余定理”。
实现代码如下：

/**
 * <url>http://en.wikipedia.org/wiki/Sexagenary_cycle</url>
 */
public class Sexagenary {
	/**
	 * 输入干支，输出对应数值。
	 */
	public static int getValue(Stems stems, Branches branches) {
		int s = stems.ordinal() + 1;
		int b = branches.ordinal() + 1;

		int value = (6 * s - 5 * b + 60) % 60;
		return value;
	}
	
	/**
	 * 输入数值，输出对应干支(String)
	 */
	public static String getStemsBranches(int num) {
		if (num < 1 || num > 60) {
			throw new IllegalArgumentException("Error input, num:" + num);
		}

		int s = ((num % 10) == 0) ? 10 : (num % 10);
		int b = ((num % 12) == 0) ? 12 : (num % 12);
		
		Stems stems = Stems.values()[s - 1];
		Branches branches = Branches.values()[b - 1];

		return "" + stems + branches;
	}
		

	public static void main(String[] args) {
		System.out.println(Stems.甲);
		System.out.println(Sexagenary.getStemsBranches(1)); // 甲子
		System.out.println(Sexagenary.getStemsBranches(53)); // 丙辰
		System.out.println("" + Sexagenary.getValue(Stems.甲, Branches.子)); // 1
		System.out.println("" + Sexagenary.getValue(Stems.丙, Branches.辰)); // 53
		System.out.println("" + Sexagenary.getValue(Stems.戊, Branches.午)); // 55
	}
}

enum Stems {
	甲, 乙, 丙, 丁, 戊, 己, 庚, 辛, 壬, 癸;
}

enum Branches {
	子, 丑, 寅, 卯, 辰, 巳, 午, 未, 申, 酉, 戌, 亥;	
}

Java综合

2011年10月08日 23:39

mycream
10
0 0 0

1个答案按时间排序按投票排序

0 0

采纳的答案

我写了个，


import java.util.HashMap;

public class ChineseCalendar {
	private final static HashMap<Character, Integer> Heavenly_Stems = new HashMap<Character, Integer>();
	private final static HashMap<Character, Integer> Earthly_Branches = new HashMap<Character, Integer>();
	static {
		Heavenly_Stems.put('甲', 1);
		Heavenly_Stems.put('乙', 2);
		Heavenly_Stems.put('丙', 3);
		Heavenly_Stems.put('丁', 4);
		Heavenly_Stems.put('戊', 5);
		Heavenly_Stems.put('己', 6);
		Heavenly_Stems.put('庚', 7);
		Heavenly_Stems.put('辛', 8);
		Heavenly_Stems.put('壬', 9);
		Heavenly_Stems.put('癸', 10);

		Earthly_Branches.put('子', 1);
		Earthly_Branches.put('丑', 2);
		Earthly_Branches.put('寅', 3);
		Earthly_Branches.put('卯', 4);
		Earthly_Branches.put('辰', 5);
		Earthly_Branches.put('巳', 6);
		Earthly_Branches.put('午', 7);
		Earthly_Branches.put('未', 8);
		Earthly_Branches.put('申', 9);
		Earthly_Branches.put('酉', 10);
		Earthly_Branches.put('戌', 11);
		Earthly_Branches.put('亥', 12);
	}

	public static int getCode(String name) {
		int n = name.length();
		if (n < 2)
			throw new IllegalArgumentException("Unknown name: " + name);

		char h = name.charAt(0);
		Integer hCode = Heavenly_Stems.get(h);
		if (hCode == null)
			throw new IllegalArgumentException("Unknown name: " + name);
		char e = name.charAt(1);
		Integer eCode = Earthly_Branches.get(e);
		if (eCode == null)
			throw new IllegalArgumentException("Unknown name: " + name);
		hCode%=10;
		eCode%=12;
		for (int c = 1; c <= 60; c++) {
			if (c % 10 == hCode && c % 12 == eCode)
				return c;
		}
		throw new IllegalArgumentException("Unknown name: " + name);
	}

	public static void main(String[] args) {
		System.out.println(getCode("甲子"));
		System.out.println(getCode("壬辰"));
		System.out.println(getCode("癸酉"));
		System.out.println(getCode("癸亥"));
		
	}
}

其实用查表法是最好的

2011年10月09日 09:27