java - All possible permutations of 2D array -

-

yesterday asked question appeared duplicate, one, however, pretty sure not duplicate, 1 teeny bit more advanced. title not explain of it, carry on reading.

let pretend have 2d array so:

{{true, false}, {true, false}, {true, false}, ...}

now, let loop through possible permutations of it:

{{false, true}, {true, false}, {true, false}, ...} {{true, false}, {false, true}, {true, false}, ...} {{true, false}, {true, false}, {false, true}, ...} {{false, true}, {true, false}, {false, true}, ...}

and forth...

since adds level it, confuses mind. know length of inner arrays two, never change. is:

boolean[][] b = new boolean[i][2];

what best way accheive possible permutations of 2d array, using java?

thank you,

this can apparently done in same way other permutation takes place, need loop on list permutation applied to, , go on possible combinations of different elements recursively.

private void permute(list<list<boolean>> list, int t) {     for(int = 0; < list.size(); ++)     {         collections.swap(list.get(i), 0, 1);         permute(list, t + 1);         collections.swap(list.get(i), 1, 0);     }      if(t == list.size() - 1)         system.out.println("another permutation."); }

and covers whole things, of sudden have mapped out possible combinations of problem explained above.

now let assume have 3 booleans instead of 2 switch in 2d manner, of sudden things more complicated.

kind regards,


Comments

Post a Comment

Popular posts from this blog

asp.net - How to correctly use QUERY_STRING in ISAPI rewrite? -

-
i'm having difficult time , hope guys can help. using helicon isapi rewrite version 3.1.0.104 on our iis server. edit http.conf file , have tried , still fail. this trying do: redirect url: https://www.domain.com/switch-by-version?version=2.8.5.2594 to: https://test.domain.com/load/load.aspx?tver=2.8.5.2594 the version number @ end source url change, , need target url have same version number @ end of url example above shows. i tried following not work: rewritecond %{query_string} ^version=(\d\d?)\.(\d\d?)\.(\d\d?)\.(.*)$ [nc] rewriterule ^/switch-by-version(.*)$ https://test.domain.com/load/load.aspx?tver=%1 [r=307,nc,l] any appreciated! thanks. if it's running in equivalent context of .htaccess , rule shouldn't start / . here's simpler version: rewritecond %{query_string} ^version=(\d+\.\d+\.\d+(?:\..+)?)$ [nc] rewriterule ^switch-by-version/?$ https://test.domain.com/load/load.aspx?tver=%1 [r=307,nc,l]
Read more

jsf - "PropertyNotWritableException: Illegal Syntax for Set Operation" error when setting value in bean -

-
this question has answer here: how send form input values , invoke method in jsf bean 1 answer i error when trying send values jsf page bean. i want set values fields in bean, create airplane instance , add database. error telling me use illegal syntax setter part of bean. why error? didnt find on site helped me problem. here jsf part: <h4>add plane</h4> <c:if test="#{not empty listairplanebb.error}"> <div class="alert alert-danger"> <span class="glyphicon glyphicon-remove"></span> <h:outputtext value="#{listairplanebb.error}" /> </div> </c:if> <h:form> <table class="table"> <thead> ...
Read more

arrays - Algorithm to find ideal starting spot in a circle -

-
so problem have been debating such: your given array of integers representing circle. then, have pick spot in circle start. place start, compare value @ array number of steps took there , if steps less or equal number, include in final set. find place start have elements in set. ex, a=[0, 1, 2] if start @ index=0, then: a[0]=0 < =0 0 included a[1]=1 < =1 1 included a[2]=2 < =2 2 included final set: {0,1,2} if start @ index=1, then: a[1]=1 > 0 1 not included a[2]=2 > 1 2 not included here loop around a[0]=0 > 2 0 included final set: {0} if start @ index=2, then: a[2]=2 > 0 2 not included, here loop around a[0]=0 < = 1 0 included a[1]=1 < = 2 1 included final set: {0,1} so in trivial case, starting position index=0 best position results in final set elements. brute force method of finding obvious, trying find more efficient method. attempts far have been examine trying find max intersect of viable starting ranges calculated each element in arr...
Read more