LotteryUtils.cs 30 KB

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