计算节气-查表法

于 2022-02-08 16:43:11 发布
阅读量466 收藏 3
点赞数
文章标签： 单片机 节气
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/neo_Wordsworth/article/details/122826405
版权

单片机存储有限，需要进行精简

如果把每一年的 节气的日期值依次排序得到一个hashcode

如：

某一年，小寒是01月06日 大寒是01月20日 立春是......

则hashcode为

010601200204021903060321040504200506052106060622070707230808082309080923100910241108112312071222

根据几百年的数据分析，hashcode是很少的几个，仅仅50个，一个char类型就可以放某年的24节气数据

于是代码如下（以下代码虽然很长，但可以通过最下面的代码生成这段代码）

（已遍历1970-2100的每一天，对比验证以下计算代码正确）

//1970年至2100年的 节气类型表
static int[] JIEQI_TABLE = {
	0,1,2,3,0,4,5,6,7,8,5,
	6,9,10,11,12,13,14,15,16,17,0,15,18,19,0,15,20,19,0,15,20,19,0,15,20,6,0,21,22,6,
	7,23,24,6,9,25,26,12,17,27,28,16,17,29,28,20,19,29,28,20,19,29,28,20,6,29,28,20,6,29,
	30,22,6,31,32,24,6,33,34,26,16,35,34,26,36,35,37,28,36,38,37,28,20,38,37,28,20,39,37,30,
	20,39,40,30,24,39,40,41,24,39,42,43,26,44,45,34,26,46,45,37,28,46,47,37,28,48,49,37,28,20,
};
//小寒->冬至 对应 1->24 | 无节气返回0
public static int GetJieqi(int y, int m, int d)
{
	int code = JIEQI_TABLE[y - YEAR_START];
	int md = m * 100 + d;

	switch (m)
	{
		case 1:
			switch (code)
			{
				case 0:
				case 1:
				case 2:
				case 4:
				case 5:
				case 7:
				case 8:
				case 9:
				case 10:
				case 11:
				case 14:
				case 15:
				case 21:
				case 23:
				case 25:
				case 27:
				case 29:
				case 31:
				case 33:
					if (md == 106) return 1;
					break;
				case 3:
				case 6:
				case 12:
				case 13:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 22:
				case 24:
				case 26:
				case 28:
				case 30:
				case 32:
				case 34:
				case 35:
				case 36:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 44:
				case 46:
				case 48:
					if (md == 105) return 1;
					break;
				case 45:
				case 47:
				case 49:
					if (md == 104) return 1;
					break;
			}
			switch (code)
			{
				case 0:
				case 3:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 12:
				case 13:
				case 14:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 22:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 35:
				case 36:
				case 38:
				case 39:
				case 41:
				case 43:
				case 44:
				case 46:
				case 48:
					if (md == 120) return 2;
					break;
				case 1:
				case 2:
				case 4:
				case 5:
				case 11:
				case 15:
				case 21:
				case 23:
					if (md == 121) return 2;
					break;
				case 34:
				case 37:
				case 40:
				case 42:
				case 45:
				case 47:
				case 49:
					if (md == 119) return 2;
					break;
			}
			break;
		case 2:
			switch (code)
			{
				case 0:
				case 1:
				case 3:
				case 4:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 11:
				case 12:
				case 13:
				case 14:
				case 15:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 27:
				case 29:
				case 31:
				case 33:
				case 35:
				case 36:
				case 38:
				case 39:
				case 44:
				case 46:
				case 48:
					if (md == 204) return 3;
					break;
				case 2:
				case 5:
					if (md == 205) return 3;
					break;
				case 26:
				case 28:
				case 30:
				case 32:
				case 34:
				case 37:
				case 40:
				case 41:
				case 42:
				case 43:
				case 45:
				case 47:
				case 49:
					if (md == 203) return 3;
					break;
			}
			switch (code)
			{
				case 0:
				case 1:
				case 2:
				case 3:
				case 4:
				case 5:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 11:
				case 12:
				case 13:
				case 14:
				case 15:
				case 16:
				case 17:
				case 19:
				case 21:
				case 23:
				case 25:
				case 27:
				case 29:
				case 31:
				case 33:
				case 35:
				case 36:
				case 38:
				case 39:
				case 44:
				case 46:
					if (md == 219) return 4;
					break;
				case 18:
				case 20:
				case 22:
				case 24:
				case 26:
				case 28:
				case 30:
				case 32:
				case 34:
				case 37:
				case 40:
				case 41:
				case 42:
				case 43:
				case 45:
				case 47:
				case 48:
				case 49:
					if (md == 218) return 4;
					break;
			}
			break;
		case 3:
			switch (code)
			{
				case 0:
				case 1:
				case 3:
				case 4:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 13:
				case 14:
				case 17:
				case 19:
					if (md == 306) return 5;
					break;
				case 2:
				case 5:
				case 11:
				case 12:
				case 15:
				case 16:
				case 18:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 36:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 45:
				case 47:
				case 49:
					if (md == 305) return 5;
					break;
				case 44:
				case 46:
				case 48:
					if (md == 304) return 5;
					break;
			}
			switch (code)
			{
				case 0:
				case 1:
				case 3:
				case 4:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 12:
				case 13:
				case 14:
				case 17:
				case 19:
					if (md == 321) return 6;
					break;
				case 2:
				case 5:
				case 11:
				case 15:
				case 16:
				case 18:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 36:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 45:
				case 47:
				case 49:
					if (md == 320) return 6;
					break;
				case 44:
				case 46:
				case 48:
					if (md == 319) return 6;
					break;
			}
			break;
		case 4:
			switch (code)
			{
				case 0:
				case 1:
				case 2:
				case 3:
				case 4:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 12:
				case 13:
				case 14:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 36:
					if (md == 405) return 7;
					break;
				case 5:
				case 11:
				case 15:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 404) return 7;
					break;
			}
			switch (code)
			{
				case 0:
				case 2:
				case 3:
				case 5:
				case 6:
				case 7:
				case 9:
				case 10:
				case 11:
				case 12:
				case 13:
				case 14:
				case 15:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 26:
				case 28:
				case 30:
				case 36:
					if (md == 420) return 8;
					break;
				case 1:
				case 4:
				case 8:
					if (md == 421) return 8;
					break;
				case 25:
				case 27:
				case 29:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 419) return 8;
					break;
			}
			break;
		case 5:
			switch (code)
			{
				case 0:
				case 1:
				case 4:
				case 7:
				case 8:
				case 9:
				case 10:
				case 13:
				case 14:
				case 17:
				case 19:
					if (md == 506) return 9;
					break;
				case 2:
				case 3:
				case 5:
				case 6:
				case 11:
				case 12:
				case 15:
				case 16:
				case 18:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 36:
				case 37:
				case 38:
				case 40:
				case 41:
				case 42:
				case 43:
				case 45:
				case 47:
				case 49:
					if (md == 505) return 9;
					break;
				case 39:
				case 44:
				case 46:
				case 48:
					if (md == 504) return 9;
					break;
			}
			switch (code)
			{
				case 0:
				case 2:
				case 3:
				case 5:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 11:
				case 12:
				case 13:
				case 14:
				case 15:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 24:
				case 26:
				case 28:
				case 36:
					if (md == 521) return 10;
					break;
				case 1:
				case 4:
					if (md == 522) return 10;
					break;
				case 23:
				case 25:
				case 27:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 520) return 10;
					break;
			}
			break;
		case 6:
			switch (code)
			{
				case 0:
				case 1:
				case 3:
				case 4:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 12:
				case 13:
				case 14:
				case 16:
				case 17:
				case 18:
				case 19:
					if (md == 606) return 11;
					break;
				case 2:
				case 5:
				case 11:
				case 15:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 36:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 44:
				case 45:
				case 47:
				case 49:
					if (md == 605) return 11;
					break;
				case 46:
				case 48:
					if (md == 604) return 11;
					break;
			}
			switch (code)
			{
				case 0:
				case 1:
				case 4:
				case 7:
				case 8:
				case 9:
				case 10:
				case 13:
				case 14:
					if (md == 622) return 12;
					break;
				case 2:
				case 3:
				case 5:
				case 6:
				case 11:
				case 12:
				case 15:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 34:
				case 36:
				case 37:
				case 40:
				case 41:
				case 43:
					if (md == 621) return 12;
					break;
				case 33:
				case 35:
				case 38:
				case 39:
				case 42:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 620) return 12;
					break;
			}
			break;
		case 7:
			switch (code)
			{
				case 0:
				case 2:
				case 3:
				case 5:
				case 6:
				case 7:
				case 9:
				case 11:
				case 12:
				case 13:
				case 14:
				case 15:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 28:
				case 30:
				case 32:
				case 36:
					if (md == 707) return 13;
					break;
				case 1:
				case 4:
				case 8:
				case 10:
					if (md == 708) return 13;
					break;
				case 27:
				case 29:
				case 31:
				case 33:
				case 34:
				case 35:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 706) return 13;
					break;
			}
			switch (code)
			{
				case 0:
				case 1:
				case 2:
				case 3:
				case 4:
				case 5:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 12:
				case 13:
				case 14:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 22:
				case 36:
					if (md == 723) return 14;
					break;
				case 11:
				case 15:
				case 21:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 722) return 14;
					break;
			}
			break;
		case 8:
			switch (code)
			{
				case 0:
				case 1:
				case 3:
				case 4:
				case 7:
				case 8:
				case 9:
				case 10:
				case 13:
				case 14:
				case 17:
				case 19:
					if (md == 808) return 15;
					break;
				case 2:
				case 5:
				case 6:
				case 11:
				case 12:
				case 15:
				case 16:
				case 18:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 36:
				case 37:
				case 38:
				case 40:
				case 41:
				case 42:
				case 43:
				case 45:
				case 47:
					if (md == 807) return 15;
					break;
				case 39:
				case 44:
				case 46:
				case 48:
				case 49:
					if (md == 806) return 15;
					break;
			}
			switch (code)
			{
				case 0:
				case 2:
				case 3:
				case 5:
				case 6:
				case 7:
				case 9:
				case 11:
				case 12:
				case 13:
				case 15:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 28:
				case 30:
				case 32:
				case 36:
				case 41:
					if (md == 823) return 16;
					break;
				case 1:
				case 4:
				case 8:
				case 10:
				case 14:
					if (md == 824) return 16;
					break;
				case 27:
				case 29:
				case 31:
				case 33:
				case 34:
				case 35:
				case 37:
				case 38:
				case 39:
				case 40:
				case 42:
				case 43:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 822) return 16;
					break;
			}
			break;
		case 9:
			switch (code)
			{
				case 0:
				case 1:
				case 3:
				case 4:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 12:
				case 13:
				case 14:
				case 17:
				case 19:
					if (md == 908) return 17;
					break;
				case 2:
				case 5:
				case 11:
				case 15:
				case 16:
				case 18:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 36:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 45:
				case 47:
				case 49:
					if (md == 907) return 17;
					break;
				case 44:
				case 46:
				case 48:
					if (md == 906) return 17;
					break;
			}
			switch (code)
			{
				case 0:
				case 2:
				case 3:
				case 4:
				case 5:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 11:
				case 12:
				case 13:
				case 14:
				case 15:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 22:
				case 24:
				case 26:
				case 28:
				case 36:
					if (md == 923) return 18;
					break;
				case 1:
					if (md == 924) return 18;
					break;
				case 21:
				case 23:
				case 25:
				case 27:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 922) return 18;
					break;
			}
			break;
		case 10:
			switch (code)
			{
				case 0:
				case 1:
				case 4:
				case 8:
				case 10:
				case 14:
					if (md == 1009) return 19;
					break;
				case 2:
				case 3:
				case 5:
				case 6:
				case 7:
				case 9:
				case 11:
				case 12:
				case 13:
				case 15:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 32:
				case 34:
				case 36:
				case 37:
				case 41:
				case 43:
					if (md == 1008) return 19;
					break;
				case 31:
				case 33:
				case 35:
				case 38:
				case 39:
				case 40:
				case 42:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 1007) return 19;
					break;
			}
			switch (code)
			{
				case 0:
				case 1:
				case 4:
				case 7:
				case 8:
				case 9:
				case 10:
				case 13:
				case 14:
				case 17:
					if (md == 1024) return 20;
					break;
				case 2:
				case 3:
				case 5:
				case 6:
				case 11:
				case 12:
				case 15:
				case 16:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 36:
				case 37:
				case 40:
				case 41:
				case 42:
				case 43:
				case 45:
					if (md == 1023) return 20;
					break;
				case 38:
				case 39:
				case 44:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 1022) return 20;
					break;
			}
			break;
		case 11:
			switch (code)
			{
				case 0:
				case 1:
				case 4:
				case 7:
				case 8:
				case 9:
				case 10:
				case 13:
				case 14:
				case 17:
					if (md == 1108) return 21;
					break;
				case 2:
				case 3:
				case 5:
				case 6:
				case 11:
				case 12:
				case 15:
				case 16:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 36:
				case 37:
				case 40:
				case 41:
				case 42:
				case 43:
				case 45:
					if (md == 1107) return 21;
					break;
				case 38:
				case 39:
				case 44:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 1106) return 21;
					break;
			}
			switch (code)
			{
				case 0:
				case 1:
				case 4:
				case 7:
				case 8:
				case 10:
				case 14:
					if (md == 1123) return 22;
					break;
				case 2:
				case 3:
				case 5:
				case 6:
				case 9:
				case 11:
				case 12:
				case 13:
				case 15:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 34:
				case 36:
				case 37:
				case 40:
				case 41:
				case 43:
					if (md == 1122) return 22;
					break;
				case 33:
				case 35:
				case 38:
				case 39:
				case 42:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 1121) return 22;
					break;
			}
			break;
		case 12:
			switch (code)
			{
				case 0:
				case 2:
				case 3:
				case 5:
				case 6:
				case 7:
				case 9:
				case 11:
				case 12:
				case 13:
				case 14:
				case 15:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 21:
				case 22:
				case 23:
				case 24:
				case 25:
				case 26:
				case 27:
				case 28:
				case 30:
				case 32:
				case 34:
				case 36:
				case 41:
				case 43:
					if (md == 1207) return 23;
					break;
				case 1:
				case 4:
				case 8:
				case 10:
					if (md == 1208) return 23;
					break;
				case 29:
				case 31:
				case 33:
				case 35:
				case 37:
				case 38:
				case 39:
				case 40:
				case 42:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 1206) return 23;
					break;
			}
			switch (code)
			{
				case 0:
				case 1:
				case 2:
				case 3:
				case 4:
				case 5:
				case 6:
				case 7:
				case 8:
				case 9:
				case 10:
				case 11:
				case 12:
				case 13:
				case 14:
				case 16:
				case 17:
				case 18:
				case 19:
				case 20:
				case 22:
				case 24:
				case 26:
				case 36:
					if (md == 1222) return 24;
					break;
				case 15:
				case 21:
				case 23:
				case 25:
				case 27:
				case 28:
				case 29:
				case 30:
				case 31:
				case 32:
				case 33:
				case 34:
				case 35:
				case 37:
				case 38:
				case 39:
				case 40:
				case 41:
				case 42:
				case 43:
				case 44:
				case 45:
				case 46:
				case 47:
				case 48:
				case 49:
					if (md == 1221) return 24;
					break;
			}
			break;
	}
	return 0;
}

用c#生成这段代码

调用CreateCode()生成以上代码

public class JieqiItem
{
	//小寒->冬至 24节气的 月日值（月*100+日）
	public int[] list = new int[24];
	public string hashCode = "";//例：01040119....   表示：小寒是1月4日 大寒是1月19日 立春是......
}

static int YEAR_START = 1970;
static int YEAR_END = 2100;
static List<JieqiItem> jieqiList = new List<JieqiItem>();
static Dictionary<string, int> jieqiDict = new Dictionary<string, int>();

//QueryJieqi函数可以通过数据库或天文计算获得，其中内容仅做参考
static JieqiItem QueryJieqi(int year)
{
	Nongli info = new Nongli();

	JieqiItem jieqiItem = new JieqiItem();
	for (int i = 0; i < 24; i++)
	{
		MySql.Query(info, year，i);
		jieqiItem.hashCode += info.GetDateStr();
		jieqiItem.list[i] = info.GetDateInt();
	}

	return jieqiItem;
}

static void Init()
{
	if (jieqiList.Count > 0)
		return;

	for (int y = YEAR_START; y <= YEAR_END; y++)
	{
		JieqiItem jieqiItem = QueryJieqi(y);
		if (!jieqiDict.ContainsKey(jieqiItem.hashCode))
		{
			jieqiDict[jieqiItem.hashCode] = jieqiList.Count;
			jieqiList.Add(jieqiItem);
		}
	}
}

public static string CreateCode()
{
	Init();

	StringBuilder sb = new StringBuilder();
	sb.AppendLine($"//{YEAR_START}年至{YEAR_END}年的 节气类型表");
	sb.AppendLine("static int[] JIEQI_TABLE = {");
	for (int y = YEAR_START; y <= YEAR_END; y++)
	{
		JieqiItem jieqiItem = QueryJieqi(y);
		sb.Append($"{jieqiDict[jieqiItem.hashCode]},");
		if (y % 30 == 0) sb.AppendLine("");
	}
	sb.AppendLine("};");

	sb.AppendLine("//小寒->冬至 对应 1->24 无节气返回0");
	sb.AppendLine("public static int GetJieqi(int y, int m, int d)\r\n{");
	sb.AppendLine("int code = JIEQI_TABLE[y - YEAR_START];");
	sb.AppendLine("int md = m * 100 + d;");
	sb.AppendLine("");
	sb.AppendLine("switch (m)\r\n{");

	for (int m = 0; m < 12; m++)
	{
		sb.AppendLine($"case {m + 1}:");

		for (int k = 0; k < 2; k++)
		{
			sb.AppendLine("switch (code)\r\n{");
			#region switch (code)

			List<int> listx = new List<int>();
			for (int i = 0; i < jieqiList.Count; i++)
			{
				if (!listx.Contains(jieqiList[i].list[m * 2 + k]))
					listx.Add(jieqiList[i].list[m * 2 + k]);
			}

			foreach (int item in listx)
			{
				for (int i = 0; i < jieqiList.Count; i++)
				{
					if (jieqiList[i].list[m * 2 + k] == item)
					{
						sb.AppendLine($"case {i}:");
					}
				}
				sb.AppendLine($"if (md == {item}) return {(m * 2 + k) + 1};");
				sb.AppendLine("break;");
			}

			#endregion
			sb.AppendLine("}");
		}

		sb.AppendLine("break;");
	}
	sb.AppendLine("}");
	sb.AppendLine("return 0;");
	sb.AppendLine("}");

	return sb.ToString();
}

Neo Wordsworth
关注
  • 0
    点赞
  • 踩
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
精确计算农历二十四节气
12-11
此demo为精确计算农历二十四节气，代码较为简单，可供参考
由阳历推算阴历，干支历，24节气（纯asp算法）
07-14
提供一套完整的ASP算法，详情请关注微信公众号unclefor，交流Asp实用编程。业余码农只写原创作品，谢谢支持！
二十四节气计算日期
03-28
通过非常复杂的算法，实现计算二十四节气准确日期，精确到秒，经过我的代码测试，这个工具类算法非常准确。可以实现上下几百年的计算。
万年历24节气C语言,电子万年历24节气c程序
weixin_34508682的博客
05-23 751
电子万年历24节气的c程序/***********************************************************************农历节气******************************///原理：因为每一个公历月会有二个节气，所以分别用高/低4位来表示//表格制作方法：比如:2010年1月5号是节气，1月20是第二个节气//高4位写第一个节气，...
高精度农历万年历：输入阳历年月日，输出阴历年月日，节气，节日，星期几。
02-27
在农历转换中，由于农历与阳历之间的复杂关系，查表法可以提供较高的计算精度。1901年至2099年的时间跨度涵盖了大部分现代人的生活需求，因此，这个范围内的查表法已经足够满足日常应用。 实现高精度农历万年历的...
SolarTerms.zip
08-01
本方法通过穷举法，完成了5000年的节气计算，节气交接时间精确到秒，并生成静态文件，可通过查表方式快速读取，缺点是静态映射表文件比较大。 为解决子问题，采用使用了 SplFileObject 高性能文件行索引方式，进行...
干支历法与农历 C 源码
12-18
公历转农历的 C 实现，采用查表法，实现1900年到2100年2个世纪的。 公历换算干支纪年月日法，采用计算法，但由于干支历法以节气划分月份，所以专门引入节气计算 通过这些，可以方便的根据公历换算出农历及生辰八字...
Python实现公历(阳历)转农历(阴历)的方法示例
09-21
本例中使用了近似天文法来计算节气。 #### 五、具体实现 ##### 1. 查表法 为了减少内存占用并提高查找效率，程序采用了特殊的存储方式。具体来说，使用一个包含多个整数的列表`g_lunar_month_day`来表示1901年至...
万年历表加节气C语言,电子万年历24节气c程序
weixin_28721019的博客
05-23 326
电子万年历24节气的c程序/***********************************************************************农历节气******************************///原理：因为每一个公历月会有二个节气，所以分别用高/低4位来表示//表格制作方法：比如:2010年1月5号是节气，1月20是第二个节气//高4位写第一个节气，...
农历二十四节气数据
04-19
mysql版，带节气来源，习俗，介绍等 季 春 夏 秋 冬 月 正月 二月 三月 四月 五月 六月 七月 八月 九月 十月 冬月 腊月 节 立春 惊蛰 清明 立夏 芒种 小暑 立秋 白露 寒露 立冬 大雪 小寒 气 雨水 春分 谷雨 小满 夏至 大暑 处暑 秋分 霜降 小雪 冬至 大寒
获取农历、兔年之类的、节气的纯JAVA代码
12-20
获取农历、兔年之类的、节气的纯JAVA代码。主要是解析，DEMO输出如下：辛卯年十一月廿六，兔，2011-12-20，星期二，冬至，--------
万年历及24节气c语言代码
09-12
很早以前写的一个50年的万年历以及24节气程序，可以计算出现在距离最近的一个节气已经过了几天或者还差几天。
冬至
02-17
冬至
冬至.Chernarus_Winter
02-12
冬至
公农历转换和获取二十四节气算法
zjp的博客
09-17 1420
用C51单片机做一个万年历的显示：涉及到公农历的转换以及获取对应二十四节气的方法的问题。 二十四节气的存储方法和数据是本人一个个算的哦，如果对大家有帮助的话，求赞+关注！ 年份信息和二十四节气信息存储数组 /*************************************************** * 公历与农历转换年份数据存储数组 * 公历年对应的农历数据,每年三字节, * 格式第一字节BIT7-4 位表示闰月月份,值为0为无闰月,BIT3-0对
二十四节气 c语言,用C语言实现农历表和二十四节气的算法
weixin_35351343的博客
05-19 2064
#includevoid DateTrans(char *chDate,int *nYear,int *nMonth,int *nDay); // 1int IsLeapYear(int nYear); // 2int GetWeekOfFirstday(int nYea...
节气表（按公元月日计算）
welcomejzh的专栏
01-11 990
节气表（按公元月日计算） 春季 立春2月3--5日交节 雨水2月18--20日交节
阳历转换为农历程序
指尖魔法师
02-12 883
阳历转化为农历，因为农历的节气具体精确到是哪一天，是一个很复杂的算法，涉及到天文学计算。 因此很多计算数据都来源于天文台的数据。 程序代码的核心其实就是查表法。 作为程序学习，其他年份的数据未完整收入。可自行去补充 #!/usr/bin/env python3 # -*- coding: utf-8 -*- """ 功能：对录入的日期进行分析星期几、农历、节气 环境：...
android 计算每年24节气
最新发布
12-16
在Android上计算每年24节气可以使用中国农历的算法。首先，需要获取当前年份和当前的阳历日期。然后，根据获取的年份，计算出该年对应的农历年份。接着，再通过农历年份计算每个节气在阳历上对应的日期。 计算农历...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值