Java实现通用组合算法（Java implements a generic combination algorithm）.docVIP

下载本文档

35
0
约8.95万字
约 19页
2017-07-15 发布于河南
举报
版权申诉

Java实现通用组合算法（Java implements a generic combination algorithm）.doc

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Java实现通用组合算法（Java implements a generic combination algorithm）

Java实现通用组合算法（Java implements a generic combination algorithm） Java implementation of general combination algorithm, there is a similar to {31311133331333} such collection, take five after eight combinations, replacing other location with non-alphanumeric characters, such as the use of *, similar {3 * * * 1133 * * * 13330,... ... } such a collection; Now theres a need for this: There is a collection like 33113330}, which is taken from 8 to 5 combinations, and other locations are replaced with non-alphanumeric characters, such as using * Numbers, to get similar {3 * * * 1133, * * * 13330,... ... } such a collection; We also ask for a collection of {3 * * * 1133, * * * * 13330}, again after 5 to 3 combinations, other locations are replaced by non-alphanumeric characters, such as the use of * Numbers, to get similar {* * * * * 133, * * * * 3303 * * * 1 * 3 *,... ... A collection like this. For such a request, the thought of implementation is as follows: First of all, the main idea is the information encoding principle, which turns 10 combinations into an 01 combination by scanning the string. Second, for each digital string, set up a single thread, in a single thread class set up a List to store digital string to be processed (may contain *, or do not contain) every number (rather than a *) in the index value; Again, set the BitSet to mark whether each location is replaced by a new combination string. Finally, in the process of scanning the original pending digital string, the BitSet is manipulated according to the index in the List of character lists, and a new combination is obtained for each BitSet. The following are implemented in the Java language: Package org. Shirdrn; Import the Java. Util. ArrayList; Import the Java. Util. BitSet; Import the Java. Util. Collection; Import the Java. Util. Collections; Import the Java. Util. HashSet; Import the Java. Util. Iterator; Import the Java. Util. List; / * * * general assembly disassembly (based on single threa