快速业务通道

嶄忽滴煽麻隈java糞? - 園殻秘壇利

作者 佚名技术 来源 NET编程 浏览 发布时间 2012-06-22
   0xa2,0x4a,0x4a,0x05,0x55,0x94,0x2d,0x0a,0x5a,0x02,0x75,0x61,0xb5,0x02,     0x6a,0x03,0x61,0x45,0xa9,0x0a,0x4a,0x05,0x25,0x25,0x2d,0x09,0x9a,0x68,     0xda,0x08,0xb4,0x09,0xa8,0x59,0x54,0x03,0xa5,0x0a,0x91,0x3a,0x96,0x04,     0xad,0xb0,0xad,0x04,0xda,0x04,0xf4,0x62,0xb4,0x05,0x54,0x0b,0x44,0x5d,     0x52,0x0a,0x95,0x04,0x55,0x22,0x6d,0x02,0x5a,0x71,0xda,0x02,0xaa,0x05,     0xb2,0x55,0x49,0x0b,0x4a,0x0a,0x2d,0x39,0x36,0x01,0x6d,0x80,0x6d,0x01,     0xd9,0x02,0xe9,0x6a,0xa8,0x05,0x29,0x0b,0x9a,0x4c,0xaa,0x08,0xb6,0x08,     0xb4,0x38,0x6c,0x09,0x54,0x75,0xd4,0x0a,0xa4,0x05,0x45,0x55,0x95,0x0a,     0x9a,0x04,0x55,0x44,0xb5,0x04,0x6a,0x82,0x6a,0x05,0xd2,0x0a,0x92,0x6a,     0x4a,0x05,0x55,0x0a,0x2a,0x4a,0x5a,0x02,0xb5,0x02,0xb2,0x31,0x69,0x03,     0x31,0x73,0xa9,0x0a,0x4a,0x05,0x2d,0x55,0x2d,0x09,0x5a,0x01,0xd5,0x48,     0xb4,0x09,0x68,0x89,0x54,0x0b,0xa4,0x0a,0xa5,0x6a,0x95,0x04,0xad,0x08,     0x6a,0x44,0xda,0x04,0x74,0x05,0xb0,0x25,0x54,0x03     };     // 兜兵晩?巷煽滴煽斤哘晩豚?     // 巷煽 1901 定 1 埖 1 晩?斤哘滴煽 4598 定 11 埖 11 晩     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 startYear = baseYear;        int startMonth = baseMonth;        int startDate = baseDate;        chineseYear = baseChineseYear;        chineseMonth = baseChineseMonth;        chineseDate = baseChineseDate;        // 及屈倖斤哘晩?喘參戻互柴麻丼楕        // 巷煽 2000 定 1 埖 1 晩?斤哘滴煽 4697 定 11 埖 25 晩        if (gregorianYear >= 2000) {           startYear = baseYear + 99;           startMonth = 1;           startDate = 1;           chineseYear = baseChineseYear + 99;           chineseMonth = 11;           chineseDate = 25;        }        int daysDiff = 0;        for (int i=startYear; i<gregorianYear; i++) {           daysDiff += 365;           if (isGregorianLeapYear(i)) daysDiff += 1; // leap year        }        for (int i=startMonth; i<gregorianMonth; i++) {           daysDiff += daysInGregorianMonth(gregorianYear,i);        }        daysDiff += gregorianDate - startDate;        chineseDate += daysDiff;        int lastDate = daysInChineseMonth(chineseYear, chineseMonth);        int nextMonth = nextChineseMonth(chineseYear, chineseMonth);        while (chineseDate>lastDate) 

凌众科技专业提供服务器租用、服务器托管、企业邮局、虚拟主机等服务,公司网站:http://www.lingzhong.cn 为了给广大客户了解更多的技术信息,本技术文章收集来源于网络,凌众科技尊重文章作者的版权,如果有涉及你的版权有必要删除你的文章,请和我们联系。以上信息与文章正文是不可分割的一部分,如果您要转载本文章,请保留以上信息,谢谢!

分享到: 更多

Copyright ©1999-2011 厦门凌众科技有限公司 厦门优通互联科技开发有限公司 All rights reserved

地址(ADD):厦门软件园二期望海路63号701E(东南融通旁) 邮编(ZIP):361008

电话:0592-5908028 传真:0592-5908039 咨询信箱:web@lingzhong.cn 咨询OICQ:173723134

《中华人民共和国增值电信业务经营许可证》闽B2-20100024  ICP备案:闽ICP备05037997号