LotteryUtils.cs 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960
  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. using System.Text;
  5. using System.Collections;
  6. using CB.Entity;
  7. namespace CB.Common
  8. {
  9. /// <summary>
  10. /// 彩票相关术语计算
  11. /// </summary>
  12. public class LotteryUtils
  13. {
  14. /// <summary>
  15. /// 计算跨度;
  16. /// count:从左至右依次取号码个数;
  17. /// </summary>
  18. /// <param name="OpenCode">号码数组</param>
  19. /// <param name="count">从左至右依次取号码个数</param>
  20. /// <returns></returns>
  21. public static int GetSpan(IList<int> OpenCode, int count = 0)
  22. {
  23. List<int> list = new List<int>(OpenCode);
  24. int n = 0 >= count ? list.Count : count;
  25. n = n > list.Count ? list.Count - 1 : n - 1;
  26. for (int i = list.Count - 1; i > n; i--)
  27. { list.RemoveAt(i); }
  28. list.Sort();
  29. return Math.Abs(list[0] - list[list.Count - 1]);
  30. }
  31. /// <summary>
  32. /// 计算和值;
  33. /// count:从左至右依次取号码个数;
  34. /// </summary>
  35. /// <param name="OpenCode">号码数组</param>
  36. /// <param name="count">从左至右依次取号码个数</param>
  37. /// <returns></returns>
  38. public static int GetSum(IList<int> OpenCode, int count = 0)
  39. {
  40. List<int> list = new List<int>(OpenCode);
  41. int n = 0 >= count ? list.Count : count;
  42. n = n > list.Count ? list.Count - 1 : n - 1;
  43. for (int i = list.Count - 1; i > n; i--)
  44. { list.RemoveAt(i); }
  45. int sum = 0;
  46. foreach (int item in list)
  47. { sum = sum + item; }
  48. return sum;
  49. }
  50. /// <summary>
  51. /// 计算大小比例;
  52. /// 大于等于splitNumber算大数;
  53. /// count:从左至右依次取号码个数;
  54. /// </summary>
  55. /// <param name="OpenCode">号码数组</param>
  56. /// <param name="splitNumber">分隔数字</param>
  57. /// <param name="count">从左至右依次取号码个数</param>
  58. /// <returns></returns>
  59. public static string GetProportionOfDX(IList<int> OpenCode, int splitNumber, int count = 0)
  60. {
  61. List<int> list = new List<int>(OpenCode);
  62. int n = 0 >= count ? list.Count : count;
  63. n = n > list.Count ? list.Count - 1 : n - 1;
  64. for (int i = list.Count - 1; i > n; i--)
  65. { list.RemoveAt(i); }
  66. int a = 0, b = 0;
  67. foreach (int item in list)
  68. {
  69. if (item >= splitNumber)
  70. { a++; }
  71. else { b++; }
  72. }
  73. return a.ToString() + ":" + b.ToString();
  74. }
  75. /// <summary>
  76. /// 计算奇偶比例;
  77. /// count:从左至右依次取号码个数;
  78. /// </summary>
  79. /// <param name="OpenCode">号码数组</param>
  80. /// <param name="count">从左至右依次取号码个数</param>
  81. /// <returns></returns>
  82. public static string GetProportionOfJO(IList<int> OpenCode, int count = 0)
  83. {
  84. List<int> list = new List<int>(OpenCode);
  85. int n = 0 >= count ? list.Count : count;
  86. n = n > list.Count ? list.Count - 1 : n - 1;
  87. for (int i = list.Count - 1; i > n; i--)
  88. { list.RemoveAt(i); }
  89. int a = 0, b = 0;
  90. foreach (int item in list)
  91. {
  92. if (1 == item % 2)
  93. { a++; }
  94. else { b++; }
  95. }
  96. return a.ToString() + ":" + b.ToString();
  97. }
  98. /// <summary>
  99. /// 计算012比例
  100. /// </summary>
  101. /// <param name="OpenCode">号码数组</param>
  102. /// <returns></returns>
  103. public static string GetProportionOf012(IList<int> OpenCode)
  104. {
  105. int[] t = { 0, 0, 0 };
  106. foreach (var item in OpenCode)
  107. {
  108. t[item % 3]++;
  109. }
  110. return t[0].ToString() + ":" + t[1].ToString() + ":" + t[2].ToString();
  111. }
  112. /// <summary>
  113. /// 计算质合比例
  114. /// </summary>
  115. /// <param name="OpenCode"></param>
  116. /// <returns></returns>
  117. public static string GetProportionOfZh(IList<int> OpenCode)
  118. {
  119. int[] t = { 0, 0 };
  120. foreach (var item in OpenCode)
  121. {
  122. if (IsPrimeNumbers(item))
  123. t[0]++;
  124. else
  125. t[1]++;
  126. }
  127. return t[0].ToString() + ":" + t[1].ToString();
  128. }
  129. /// <summary>
  130. /// 判断是否为质数
  131. /// </summary>
  132. /// <param name="number"></param>
  133. /// <returns></returns>
  134. public static bool IsPrimeNumbers(int number)
  135. {
  136. if (0 == number)
  137. return false;
  138. int iii = number / 2;
  139. for (int ii = 2; ii <= iii; ii++)
  140. {
  141. if (0 == number % ii)
  142. {
  143. return false;
  144. }
  145. }
  146. return true;
  147. }
  148. /// <summary>
  149. /// 福彩3D判断大小
  150. /// </summary>
  151. /// <param name="item"></param>
  152. /// <returns></returns>
  153. public static bool IsDxNumbers(int item)
  154. {
  155. if (item > 4)
  156. {
  157. return true;
  158. }
  159. else
  160. {
  161. return false;
  162. }
  163. }
  164. /// <summary>
  165. /// 计算三区比(适用于双色球)
  166. /// </summary>
  167. /// <param name="item"></param>
  168. /// <returns></returns>
  169. public static string SsqSanQu(IList<int> kjh)
  170. {
  171. int sanqu = 0, sanqu1 = 0, sanqu2 = 0;
  172. foreach (int item in kjh)
  173. {
  174. if (item >= 1 && item <= 11)
  175. {
  176. sanqu++;
  177. }
  178. if (item >= 12 && item <= 22)
  179. {
  180. sanqu1++;
  181. }
  182. if (item >= 23 && item <= 33)
  183. {
  184. sanqu2++;
  185. }
  186. }
  187. return string.Format("{0}:{1}:{2}", sanqu, sanqu1, sanqu2);
  188. }
  189. /// <summary>
  190. /// 计算ac值
  191. /// </summary>
  192. /// <param name="kjh">需计算的开奖号码</param>
  193. /// <returns></returns>
  194. public static int GetAC(string[] kjh)
  195. {
  196. List<string> result = GetCombination(kjh, 2);
  197. ArrayList acarray = new ArrayList();
  198. int tpac = 0;
  199. for (int i = 0; i < result.Count; i++)
  200. {
  201. string[] tp = result[i].Split(',');
  202. int tmp = Math.Abs(Convert.ToInt32(tp[0]) - Convert.ToInt32(tp[1]));
  203. if (!acarray.Contains(tmp))
  204. {
  205. tpac++;
  206. acarray.Add(tmp);
  207. }
  208. }
  209. return tpac - (kjh.Length - 1);
  210. }
  211. public static List<string> GetCombination(string[] data, int count)
  212. {
  213. Dictionary<string, int> dic = new Dictionary<string, int>();
  214. List<string> output = new List<string>();
  215. for (int i = 0; i < data.Length; i++)
  216. {
  217. dic.Add(data[i], i);
  218. }
  219. SelectN(dic, data, count, 1, ref output);
  220. return output;
  221. }
  222. private static void SelectN(Dictionary<string, int> dd, string[] data, int count, int times, ref List<string> output)
  223. {
  224. Dictionary<string, int> dic = new Dictionary<string, int>();
  225. foreach (KeyValuePair<string, int> kv in dd)
  226. {
  227. for (int i = kv.Value + 1; i < data.Length; i++)
  228. {
  229. if (times < count - 1)
  230. {
  231. dic.Add(kv.Key + "," + data[i], i);
  232. }
  233. else
  234. {
  235. output.Add(kv.Key + "," + data[i]);
  236. }
  237. }
  238. }
  239. times++;
  240. if (dic.Count > 0)
  241. {
  242. SelectN(dic, data, count, times, ref output);
  243. }
  244. }
  245. /// <summary>
  246. /// 判断奇偶
  247. /// </summary>
  248. /// <param name="item"></param>
  249. /// <returns></returns>
  250. public static bool IsJoNumbers(int item)
  251. {
  252. if (item % 2 == 0)
  253. {
  254. return false;
  255. }
  256. else
  257. {
  258. return true;
  259. }
  260. }
  261. /// <summary>
  262. /// 根据开奖号获取奇偶形态
  263. /// </summary>
  264. /// <param name="list"></param>
  265. /// <returns></returns>
  266. public static string GetJOString(IList<int> list)
  267. {
  268. StringBuilder sb = new StringBuilder(list.Count * 2);
  269. foreach (var item in list)
  270. {
  271. if (item % 2 == 0)
  272. {
  273. sb.Append("偶");
  274. }
  275. else
  276. {
  277. sb.Append("奇");
  278. }
  279. }
  280. return sb.ToString();
  281. }
  282. /// <summary>
  283. /// 根据开奖号获取大小形态
  284. /// </summary>
  285. /// <param name="list"></param>
  286. /// <returns></returns>
  287. public static string GetDXString(IList<int> list, int splitNumber)
  288. {
  289. StringBuilder sb = new StringBuilder(list.Count * 2);
  290. foreach (var item in list)
  291. {
  292. if (item >= splitNumber)
  293. {
  294. sb.Append("大");
  295. }
  296. else
  297. {
  298. sb.Append("小");
  299. }
  300. }
  301. return sb.ToString();
  302. }
  303. /// <summary>
  304. /// 根据开奖号获取质合形态
  305. /// </summary>
  306. /// <param name="list"></param>
  307. /// <returns></returns>
  308. public static string GetZHString(IList<int> list)
  309. {
  310. StringBuilder sb = new StringBuilder(list.Count * 2);
  311. bool zh;
  312. foreach (var item in list)
  313. {
  314. zh = true;
  315. if (item == 0)
  316. {
  317. sb.Append("合");
  318. continue;
  319. }
  320. for (int i = 2; i < item; i++)
  321. {
  322. if (item % i == 0)
  323. {
  324. sb.Append("合");
  325. zh = false;
  326. break;
  327. }
  328. }
  329. if (zh)
  330. {
  331. sb.Append("质");
  332. }
  333. }
  334. return sb.ToString();
  335. }
  336. /// <summary>
  337. /// 根据开奖号获取012形态
  338. /// </summary>
  339. /// <param name="list"></param>
  340. /// <returns></returns>
  341. public static string Get012String(IList<int> list)
  342. {
  343. StringBuilder sb = new StringBuilder(list.Count * 2);
  344. foreach (var item in list)
  345. {
  346. sb.Append((item % 3).ToString());
  347. }
  348. return sb.ToString();
  349. }
  350. /// <summary>
  351. /// 根据开奖号获取和尾值形态
  352. /// </summary>
  353. /// <param name="list"></param>
  354. /// <returns></returns>
  355. public static string GetHWString(IList<int> list)
  356. {
  357. string sum = GetSum(list).ToString();
  358. return sum[sum.Length - 1].ToString();
  359. }
  360. /// <summary>
  361. /// 模拟开奖号期数下拉列表
  362. /// </summary>
  363. /// <param name="topSize"></param>
  364. /// <param name="latestQi"></param>
  365. /// <param name="lottery"></param>
  366. /// <param name="formartUrl">格式化期数</param>
  367. /// <returns></returns>
  368. public static string GetLotteryDDLQi(int topSize, long latestQi, string lottery, string formartUrl)
  369. {
  370. StringBuilder sp = new StringBuilder(512);
  371. int minQi = 0, y = 0, j = 1, endQi = 0, line = 1, _qi = 0;
  372. int year = (int)latestQi / 1000;
  373. int startQi = year * 1000 + 1;
  374. switch (lottery)
  375. {
  376. case "qlc":
  377. minQi = 2002001;
  378. break;
  379. case "3d":
  380. minQi = 2002001;
  381. break;
  382. case "ssq":
  383. minQi = 2003001;
  384. break;
  385. case "dlt":
  386. minQi = 2007001;
  387. break;
  388. case "p3":
  389. minQi = 2004001;
  390. break;
  391. case "p5":
  392. minQi = 2004001;
  393. break;
  394. case "qxc":
  395. minQi = 2006001;
  396. break;
  397. case "3dshijihao":
  398. minQi = 2002001;
  399. break;
  400. case "p3shijihao":
  401. minQi = 2004001;
  402. break;
  403. case "hc1":
  404. minQi = 2002001;
  405. break;
  406. case "df6j1":
  407. minQi = 2016059;
  408. break;
  409. case "hd15x5":
  410. minQi = 2016138;
  411. break;
  412. case "hn22x5":
  413. minQi = 2016138;
  414. break;
  415. case "ny36x7":
  416. minQi = 2016138;
  417. break;
  418. case "hb22X5":
  419. minQi = 16138;
  420. break;
  421. case "hb30x5":
  422. minQi = 16001;
  423. break;
  424. case "xj35x7":
  425. minQi = 2016040;
  426. break;
  427. case "js7ws":
  428. minQi = 16079;
  429. break;
  430. case "zj6j1":
  431. minQi = 16060;
  432. break;
  433. case "fj31x7":
  434. minQi = 16082;
  435. break;
  436. case "fj36x7":
  437. minQi = 16059;
  438. break;
  439. }
  440. while (line <= topSize)
  441. {
  442. _qi = (int)latestQi - j;
  443. if (_qi < minQi)
  444. break;
  445. if (_qi < startQi)
  446. {
  447. y = y + 1;
  448. startQi = (year - y) * 1000 + 1;
  449. endQi = (year - y) * 1000 + 153;
  450. if (lottery == "3d" || lottery == "p3" || lottery == "p5" || lottery == "3dshijihao" || lottery == "p3shijihao" || lottery == "hc1"||lottery=="df6j1"||lottery=="hd15x5"||lottery=="hn22x5"||lottery=="ny36x7"||lottery=="xj35x7")
  451. {
  452. endQi = (year - y) * 1000 + 358;
  453. if (2014 == (year - y))
  454. endQi = 2014357;
  455. }
  456. if (0 == ((year - y) % 4))
  457. {
  458. endQi = endQi + 1;
  459. }
  460. latestQi = endQi;
  461. _qi = endQi;
  462. j = 0;
  463. }
  464. sp.AppendFormat("<li><a href=\"{0}.htm\">{1}</a></li>", string.Format(formartUrl + _qi), _qi);
  465. j++;
  466. line++;
  467. }
  468. return sp.ToString();
  469. }
  470. /// <summary>
  471. /// 模拟开奖号期数下拉列表2
  472. /// </summary>
  473. /// <param name="topSize"></param>
  474. /// <param name="latestQi"></param>
  475. /// <param name="lottery"></param>
  476. /// <returns></returns>
  477. public static List<dynamic> GetLotteryDDLQi2(int topSize, long latestQi, string lottery)
  478. {
  479. var objCodeList = new List<dynamic>();
  480. dynamic objsCode = new System.Dynamic.ExpandoObject();
  481. //var objNumberList = new List<dynamic>();
  482. //var objsNumber = new ExpandoObject();
  483. StringBuilder sp = new StringBuilder(512);
  484. int minQi = 0, y = 0, j = 1, endQi = 0, line = 1, _qi = 0;
  485. int year = (int)latestQi / 1000;
  486. int startQi = year * 1000 + 1;
  487. switch (lottery)
  488. {
  489. case "qlc":
  490. minQi = 2002001;
  491. break;
  492. case "3d":
  493. minQi = 2002001;
  494. break;
  495. case "ssq":
  496. minQi = 2003001;
  497. break;
  498. case "dlt":
  499. minQi = 2007001;
  500. break;
  501. case "p3":
  502. minQi = 2004001;
  503. break;
  504. case "p5":
  505. minQi = 2004001;
  506. break;
  507. case "qxc":
  508. minQi = 2006001;
  509. break;
  510. case "3dshijihao":
  511. minQi = 2002001;
  512. break;
  513. case "p3shijihao":
  514. minQi = 2004001;
  515. break;
  516. case "hc1":
  517. minQi = 2002001;
  518. break;
  519. case "df6j1":
  520. minQi = 2016059;
  521. break;
  522. case "hd15x5":
  523. minQi = 2016138;
  524. break;
  525. case "hn22x5":
  526. minQi = 2016138;
  527. break;
  528. case "ny36x7":
  529. minQi = 2016138;
  530. break;
  531. case "hb22X5":
  532. minQi = 16138;
  533. break;
  534. case "hb30x5":
  535. minQi = 16001;
  536. break;
  537. case "xj35x7":
  538. minQi = 2016040;
  539. break;
  540. case "js7ws":
  541. minQi = 16079;
  542. break;
  543. case "zj6j1":
  544. minQi = 16060;
  545. break;
  546. case "fj31x7":
  547. minQi = 16082;
  548. break;
  549. case "fj36x7":
  550. minQi = 16059;
  551. break;
  552. }
  553. while (line <= topSize)
  554. {
  555. _qi = (int)latestQi - j;
  556. if (_qi < minQi)
  557. break;
  558. if (_qi < startQi)
  559. {
  560. y = y + 1;
  561. startQi = (year - y) * 1000 + 1;
  562. endQi = (year - y) * 1000 + 153;
  563. if (lottery == "3d" || lottery == "p3" || lottery == "p5" || lottery == "3dshijihao" || lottery == "p3shijihao" || lottery == "hc1" || lottery == "df6j1" || lottery == "hd15x5" || lottery == "hn22x5" || lottery == "ny36x7" || lottery == "xj35x7")
  564. {
  565. endQi = (year - y) * 1000 + 358;
  566. if (2014 == (year - y))
  567. endQi = 2014357;
  568. }
  569. if (0 == ((year - y) % 4))
  570. {
  571. endQi = endQi + 1;
  572. }
  573. latestQi = endQi;
  574. _qi = endQi;
  575. j = 0;
  576. }
  577. objsCode.value = _qi;
  578. objCodeList.Add(objsCode);
  579. objsCode = new System.Dynamic.ExpandoObject();
  580. j++;
  581. line++;
  582. }
  583. return objCodeList;
  584. }
  585. /// <summary>
  586. /// 手机端开奖结果下拉
  587. /// </summary>
  588. /// <param name="topSize"></param>
  589. /// <param name="latestQi"></param>
  590. /// <returns></returns>
  591. public static string GetLotteryDDLQi(int topSize, long latestQi,string lottery)
  592. {
  593. StringBuilder sp = new StringBuilder(512);
  594. int minQi = 0, y = 0, j = 1, endQi = 0, line = 1, _qi = 0;
  595. int year = (int)latestQi / 1000;
  596. int startQi = year * 1000 + 1;
  597. switch (lottery)
  598. {
  599. case "qlc":
  600. minQi = 2002001;
  601. break;
  602. case "3d":
  603. minQi = 2002001;
  604. break;
  605. case "ssq":
  606. minQi = 2003001;
  607. break;
  608. case "dlt":
  609. minQi = 2007001;
  610. break;
  611. case "p3":
  612. minQi = 2004001;
  613. break;
  614. case "p5":
  615. minQi = 2004001;
  616. break;
  617. case "qxc":
  618. minQi = 2006001;
  619. break;
  620. case "3dshijihao":
  621. minQi = 2002001;
  622. break;
  623. case "p3shijihao":
  624. minQi = 2004001;
  625. break;
  626. case "hc1":
  627. minQi = 2002001;
  628. break;
  629. case "df6j1":
  630. minQi = 2016059;
  631. break;
  632. case "hd15x5":
  633. minQi = 2016138;
  634. break;
  635. case "hn22x5":
  636. minQi = 2016138;
  637. break;
  638. case "ny36x7":
  639. minQi = 2016138;
  640. break;
  641. case "hb22X5":
  642. minQi = 16138;
  643. break;
  644. case "hb30x5":
  645. minQi = 16001;
  646. break;
  647. case "xj35x7":
  648. minQi = 2016040;
  649. break;
  650. case "js7ws":
  651. minQi = 16079;
  652. break;
  653. case "zj6j1":
  654. minQi = 16060;
  655. break;
  656. case "fj31x7":
  657. minQi = 16082;
  658. break;
  659. case "fj36x7":
  660. minQi = 16059;
  661. break;
  662. }
  663. while (line <= topSize)
  664. {
  665. _qi = (int)latestQi - j;
  666. if (_qi < minQi)
  667. break;
  668. if (_qi < startQi)
  669. {
  670. y = y + 1;
  671. startQi = (year - y) * 1000 + 1;
  672. endQi = (year - y) * 1000 + 153;
  673. if (lottery == "3d" || lottery == "p3" || lottery == "p5" || lottery == "3dshijihao" || lottery == "p3shijihao" || lottery == "hc1" || lottery == "df6j1" || lottery == "hd15x5" || lottery == "hn22x5" || lottery == "ny36x7" || lottery == "xj35x7")
  674. {
  675. endQi = (year - y) * 1000 + 358;
  676. if (2014 == (year - y))
  677. endQi = 2014357;
  678. }
  679. if (0 == ((year - y) % 4))
  680. {
  681. endQi = endQi + 1;
  682. }
  683. latestQi = endQi;
  684. _qi = endQi;
  685. j = 0;
  686. }
  687. //todo:临时增加需要补位的彩种缩写
  688. if (lottery == "zj6j1" || lottery == "js7ws" || lottery == "hb22x5" || lottery == "hb30x5" || lottery == "fj31x7" || lottery == "fj36x7")
  689. {
  690. _qi = 2000000 + _qi;
  691. }
  692. sp.AppendFormat("<option>{0}</option>", _qi);
  693. j++;
  694. line++;
  695. }
  696. return sp.ToString();
  697. }
  698. /// <summary>
  699. /// 模拟开奖号、试机号、开机号期数下拉列表
  700. /// </summary>
  701. /// <param name="topSize"></param>
  702. /// <param name="latestQi"></param>
  703. /// <param name="lottery"></param>
  704. /// <param name="formatHTML"></param>
  705. /// <param name="formatUrl"></param>
  706. /// <returns></returns>
  707. public static string GetLotteryDDLQi(int topSize, long latestQi, string lottery, string formatHTML, string formatUrl)
  708. {
  709. var sp = new StringBuilder(topSize * (formatHTML.Length + formatUrl.Length + 10));
  710. int minQi = 0, y = 0, j = 0, endQi = 0, line = 1, _qi = 0;
  711. int year = (int)latestQi / 1000;
  712. int startQi = year * 1000 + 1;
  713. switch (lottery)
  714. {
  715. case "qlc":
  716. minQi = 2002001;
  717. break;
  718. case "3d":
  719. minQi = 2002001;
  720. break;
  721. case "ssq":
  722. minQi = 2003001;
  723. break;
  724. case "dlt":
  725. minQi = 2007001;
  726. break;
  727. case "p3":
  728. minQi = 2004001;
  729. break;
  730. case "p5":
  731. minQi = 2004001;
  732. break;
  733. case "qxc":
  734. minQi = 2006001;
  735. break;
  736. case "3dshijihao":
  737. minQi = 2002001;
  738. break;
  739. case "p3shijihao":
  740. minQi = 2004001;
  741. break;
  742. case "hc1":
  743. minQi = 2002001;
  744. break;
  745. }
  746. while (line <= topSize)
  747. {
  748. _qi = (int)latestQi - j;
  749. if (_qi < minQi)
  750. break;
  751. if (_qi < startQi)
  752. {
  753. y = y + 1;
  754. startQi = (year - y) * 1000 + 1;
  755. endQi = (year - y) * 1000 + 153;
  756. if (lottery == "3d" || lottery == "p3" || lottery == "p5" || lottery == "3dshijihao" || lottery == "p3shijihao" || lottery == "hc1")
  757. {
  758. endQi = (year - y) * 1000 + 358;
  759. if (2014 == (year - y))
  760. endQi = 2014357;
  761. }
  762. if (0 == ((year - y) % 4))
  763. {
  764. endQi = endQi + 1;
  765. }
  766. latestQi = endQi;
  767. _qi = endQi;
  768. j = 0;
  769. }
  770. sp.AppendFormat(formatHTML, string.Format(formatUrl, _qi), _qi);
  771. j++;
  772. line++;
  773. }
  774. return sp.ToString();
  775. }
  776. /// <summary>
  777. /// 获取开奖号码
  778. /// </summary>
  779. /// <typeparam name="TEntity"></typeparam>
  780. /// <param name="entity"></param>
  781. /// <param name="indexStart"></param>
  782. /// <param name="indexEnd"></param>
  783. /// <returns></returns>
  784. public static IList<int> GetOpenCodeList<TEntity>(TEntity entity, int indexStart, int indexEnd) where TEntity : LotteryOpenCode
  785. {
  786. IList<int> list = new List<int>(entity.OpenCode);
  787. if (-1 != indexEnd)
  788. {
  789. for (int i = list.Count - 1; i >= indexEnd; i--)
  790. { list.RemoveAt(i); }
  791. }
  792. for (int i = 0; i < indexStart; i++)
  793. { list.RemoveAt(0); }
  794. return list;
  795. }
  796. /// <summary>
  797. /// 福建31选7三区比
  798. /// </summary>
  799. /// <param name="list"></param>
  800. /// <returns></returns>
  801. public static string Fj31x7SanQu(IList<int> list)
  802. {
  803. int sanqu = 0, sanqu1 = 0, sanqu2 = 0;
  804. foreach (int item in list)
  805. {
  806. if (item >= 1 && item <= 10)
  807. {
  808. sanqu++;
  809. }
  810. if (item >= 11 && item <= 20)
  811. {
  812. sanqu1++;
  813. }
  814. if (item >= 21 && item <= 31)
  815. {
  816. sanqu2++;
  817. }
  818. }
  819. return string.Format("{0}:{1}:{2}", sanqu, sanqu1, sanqu2);
  820. }
  821. /// <summary>
  822. /// 福建31选7三区比
  823. /// </summary>
  824. /// <param name="list"></param>
  825. /// <returns></returns>
  826. public static string Fj36x7SanQu(IList<int> list)
  827. {
  828. int sanqu = 0, sanqu1 = 0, sanqu2 = 0;
  829. foreach (int item in list)
  830. {
  831. if (item >= 1 && item <= 12)
  832. {
  833. sanqu++;
  834. }
  835. if (item >= 13 && item <= 24)
  836. {
  837. sanqu1++;
  838. }
  839. if (item >= 25 && item <= 36)
  840. {
  841. sanqu2++;
  842. }
  843. }
  844. return string.Format("{0}:{1}:{2}", sanqu, sanqu1, sanqu2);
  845. }
  846. /// <summary>
  847. /// 华东15选5三区比
  848. /// </summary>
  849. /// <param name="list"></param>
  850. /// <returns></returns>
  851. public static string Hd15x5SanQu(IList<int> list)
  852. {
  853. int sanqu = 0, sanqu1 = 0, sanqu2 = 0;
  854. foreach (int item in list)
  855. {
  856. if (item >= 1 && item <= 5)
  857. {
  858. sanqu++;
  859. }
  860. if (item >= 6 && item <= 10)
  861. {
  862. sanqu1++;
  863. }
  864. if (item >= 11 && item <= 15)
  865. {
  866. sanqu2++;
  867. }
  868. }
  869. return string.Format("{0}:{1}:{2}", sanqu, sanqu1, sanqu2);
  870. }
  871. /// <summary>
  872. /// 南粤36选7三区比
  873. /// </summary>
  874. /// <param name="list"></param>
  875. /// <returns></returns>
  876. public static string Ny36x7SanQu(IList<int> list)
  877. {
  878. int sanqu = 0, sanqu1 = 0, sanqu2 = 0;
  879. foreach (int item in list)
  880. {
  881. if (item >= 1 && item <= 12)
  882. {
  883. sanqu++;
  884. }
  885. if (item >= 13 && item <= 24)
  886. {
  887. sanqu1++;
  888. }
  889. if (item >= 25 && item <= 36)
  890. {
  891. sanqu2++;
  892. }
  893. }
  894. return string.Format("{0}:{1}:{2}", sanqu, sanqu1, sanqu2);
  895. }
  896. /// <summary>
  897. /// 获取中奖数字
  898. /// </summary>
  899. /// <param name="arr1">开奖号</param>
  900. /// <param name="arr2">对比号</param>
  901. /// <returns></returns>
  902. public static int[] GetTheSameOpenCodes(int[] arr1, int[] arr2)
  903. {
  904. Array.Sort(arr1);
  905. Array.Sort(arr2);
  906. var list = new List<int>();
  907. for (int indexA = 0, lenA = arr1.Length, indexB = 0, lenB = arr2.Length; indexA < lenA && indexB < lenB; )
  908. {
  909. if (arr1[indexA] == arr2[indexB])
  910. {
  911. list.Add(arr1[indexA]);
  912. System.Diagnostics.Debug.WriteLine(arr1[indexA] + " , ");
  913. indexA++;
  914. indexB++;
  915. }
  916. else if (arr1[indexA] < arr2[indexB])
  917. {
  918. indexA++;
  919. }
  920. else
  921. {
  922. indexB++;
  923. }
  924. }
  925. return list.ToArray();
  926. }
  927. /// <summary>
  928. /// 获取命中数
  929. /// </summary>
  930. /// <returns></returns>
  931. public static int GetTheHitRate(int[] arr1,params int[] arr2)
  932. {
  933. var n = GetTheSameOpenCodes(arr1, arr2).Length;
  934. return n;
  935. }
  936. }
  937. }