中国公历算法
中国公历算法不是太难,关键是星期值的确定。这里给出了简单算法:
public static int dayofweek(int y, int m, int d) {
int w = 1; // 公历一年一月一日是星期一,所以起始值为星期日
y = (y-1)%400 + 1; // 公历星期值分部 400 年循环一次
int ly = (y-1)/4; // 闰年次数
ly = ly - (y-1)/100;
ly = ly + (y-1)/400;
int ry = y - 1 - ly; // 常年次数
w = w + ry; // 常年星期值增一
w = w + 2*ly; // 闰年星期值增二
w = w + dayofyear(y,m,d);
w = (w-1)%7 + 1;
return w;
}
中国农历算法
根公历相比,中国农历的算法相当复杂。我在网上找的算法之中,eleworld.com 的算法是最好的一个。这个算法使用了大量的数据来确定农历月份和节气的分部,它仅实用于公历 1901 年到 2100 年之间的 200 年。
中国农历计算程式
跟据 eleworld.com 提供的算法,我写了下面这个程式:
[html]
/**
* chinesecalendargb.java
* copyright (c) 1997-2002 by dr. herong yang. http://www.herongyang.com/
* 中国农历算法 - 实用于公历 1901 年至 2100 年之间的 200 年
*/
import java.text.*;
import java.util.*;
class chinesecalendargb {
private int gregorianyear;
private int gregorianmonth;
private int gregoriandate;
private boolean isgregorianleap;
private int dayofyear;
private int dayofweek; // 周日一星期的第一天
private int chineseyear;
private int chinesemonth; // 负数表示闰月
private int chinesedate;
private int sectionalterm;
private int principleterm;
private static char[] daysingregorianmonth =
{31,28,31,30,31,30,31,31,30,31,30,31};
private static string[] stemnames =
{"甲","乙","丙","丁","戊","己","庚","辛","壬","癸"};
private static string[] branchnames =
{"子","丑","寅","卯","辰","巳","午","未","申","酉","戌","亥"};
private static string[] animalnames =
{"鼠","牛","虎","兔","龙","蛇","马","羊","猴","鸡","狗","猪"};
public static void main(string[] arg) {
chinesecalendargb c = new chinesecalendargb();
string cmd = "day";
int y = 1901;
int m = 1;
int d = 1;
if (arg.length>0) cmd = arg[0];
if (arg.length>1) y = integer.parseint(arg[1]);
if (arg.length>2) m = integer.parseint(arg[2]);
if (arg.length>3) d = integer.parseint(arg[3]);
c.setgregorian(y,m,d);
c.computechinesefields();
c.computesolarterms();
if (cmd.equalsignorecase("year")) {
string[] t = c.getyeartable();
for (int i=0; i
} else if (cmd.equalsignorecase("month")) {
string[] t = c.getmonthtable();
for (int i=0; i
} else {
system.out.println(c.tostring());
}
}
public chinesecalendargb() {
setgregorian(1901,1,1);
}
public void setgregorian(int y, int m, int d) {
gregorianyear = y;
gregorianmonth = m;
gregoriandate = d;
isgregorianleap = isgregorianleapyear(y);
dayofyear = dayofyear(y,m,d);
dayofweek = dayofweek(y,m,d);
chineseyear = 0;
chinesemonth = 0;
chinesedate = 0;
sectionalterm = 0;
principleterm = 0;
}
public static boolean isgregorianleapyear(int year) {
boolean isleap = false;
if (year%4==0) isleap = true;
if (year%100==0) isleap = false;
if (year%400==0) isleap = true;
return isleap;
}
public static int daysingregorianmonth(int y, int m) {
int d = daysingregorianmonth[m-1];
if (m==2 && isgregorianleapyear(y)) d++; // 公历闰年二月多一天
return d;
}
public static int dayofyear(int y, int m, int d) {
int c = 0;
for (int i=1; i
c = c + daysingregorianmonth(y,i);
}
c = c + d;
return c;
}
public static int dayofweek(int y, int m, int d) {
int w = 1; // 公历一年一月一日是星期一,所以起始值为星期日
y = (y-1)%400 + 1; // 公历星期值分部 400 年循环一次
int ly = (y-1)/4; // 闰年次数
ly = ly - (y-1)/100;
ly = ly + (y-1)/400;
int ry = y - 1 - ly; // 常年次数
w = w + ry; // 常年星期值增一
w = w + 2*ly; // 闰年星期值增二
w = w + dayofyear(y,m,d);
w = (w-1)%7 + 1;
return w;
}
private static char[] chinesemonths = {
// 农历月份大小压缩表,两个字节表示一年。两个字节共十六个二进制位数,
// 前四个位数表示闰月月份,后十二个位数表示十二个农历月份的大小。
0x00,0x04,0xad,0x08,0x
0x95,0x
0xb4,0x55,0x52,0x0d,0x94,0x
0xda,0x02,0xd2,0x52,0xa9,0x05,0x49,0x0d,0x
0xb5,0x20,0x6d,0x01,0x59,0x69,0xd4,0x
0x2b,0x09,0x9e,0x38,0xb6,0x08,0xec,0x74,0x
0x52,0x05,0x95,0x
0x52,0x75,0xc9,0x
0xb5,0x02,0x
0xaa,0x48,0x
0x96,0x04,0x4d,0x54,0xad,0x04,0xda,0x04,0xd4,0x44,0xb4,0x05,0x54,0x85,
0x52,0x0d,0x92,0x
0xb2,0xa1,0xa9,0x05,0x49,0x0d,0x
0x6d,0x01,0xd9,0x02,0xd1,0x
0x96,0x54,0xb6,0x08,0x
0x95,0x
0xa2,0x
0x
0xda,0x08,0xb4,0x09,0xa8,0x59,0x54,0x03,0xa5,0x
0xad,0xb0,0xad,0x04,0xda,0x04,0xf4,0x62,0xb4,0x05,0x54,0x0b,0x44,0x5d,
0x52,0x
0xb2,0x55,0x49,0x0b,0x
0xd9,0x02,0xe9,0x
0xb4,0x38,0x
0x
0x
0x31,0x73,0xa9,0x
0xb4,0x09,0x68,0x89,0x54,0x0b,0xa4,0x
0x
};
// 初始日,公历农历对应日期:
// 公历
private static int baseyear = 1901;
private static int basemonth = 1;
private static int basedate = 1;
private static int baseindex = 0;
private static int basechineseyear = 4598-1;
private static int basechinesemonth = 11;
private static int basechinesedate = 11;
public int computechinesefields() {
if (gregorianyear<1901 || gregorianyear>2100) return 1;
int
int
int
chineseyear = basechineseyear;
chinesemonth = basechinesemonth;
chinesedate = basechinesedate;
// 第二个对应日,用以提高计算效率
// 公历
if (gregorianyear >= 2000) {
chineseyear = basechineseyear + 99;
-
关于我们
公司介绍 最新动态 联系我们 -
产品与服务
域名注册 jsp空间 php空间 -
常见问题
空间操作手册 网站备案相关 退款相关问题 -
技术支持
技术 QQ :178966803 联系电话:13616026886 联系邮箱:fjjsp@vip.163.com
扫描关注微信公众号
闽公网安备 35060202000074号