java实现通用组合算法（Java implementation of a general combination algorithm）.docVIP

下载本文档

7
0
约8.11千字
约 16页
2017-09-03 发布于河南
举报
版权申诉

java实现通用组合算法（Java implementation of a general 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 implementation of a general combination algorithm）

java实现通用组合算法（Java implementation of a general combination algorithm） Java implementation of general combinatorial algorithms, there is a similar {3131113333113330} such a set, after 8 out of 5 combinations, the other position is replaced by non alphanumeric characters, such as the use of *, similar to {3***1133, ***13330,...} such a set..; There is such a demand now: There is a similar {3131113333113330} such a set, after 8 out of 5 combinations, the other position is replaced by non alphanumeric characters, such as the use of *, similar to {3***1133, ***13330,...} such a set..; Also for {3***1133, ***13330} such a set, again after 5 out of 3 combinations, the other position is replaced by non alphanumeric characters, such as the use of *, similar to {*****133, *****330, 3***1*3*,...} such a set... For such a request, the following ideas are implemented: First of all, the main idea is based on the principle of information encoding, by scanning strings, the combination of 10 into 01 combinations. Secondly, for each digit string, setting a single thread, set up a List in a single thread class used to store pending digital (string may contain *, or do not contain) of each number (not *) index value; Again, set BitSet to indicate whether each location has been replaced by * to get a new combination string. Finally, in the process of scanning the raw string to be processed, the BitSet is operated according to the index in the set of character list List, and a new combination is obtained for each BitSet. Using the Java language, the following: Package org.shirdrn; Import java.util.ArrayList; Import java.util.BitSet; Import java.util.Collection; Import java.util.Collections; Import java.util.HashSet; Import java.util.Iterator; Import java.util.List; / * * * general assembly disassembly classification (based on single thread) * two functions can be completed: * first, you can split a full number string into a string containing * numbers. * for example, enter the collection