View difference between Paste ID: Dmwnf8FT and
SHOW:
|
|
- or go back to the newest paste.
1 | int[][] goodEnd = { {},{},{},{},{},{},{},{},{},{},{},{},{}}; | |
2 | ||
3 | loops{ //... p1Counter is a variable for a for loop | |
4 | int counterPnt = 0; | |
5 | loops{ | |
6 | if(goodEnd[plCounter].Array.asList().Arrays.contains(currentPnt)){ | |
7 | for(arrayCounter = 0; arrayCounter < 100; arrayCounter ++){ | |
8 | pathsTotal[arrayCounter] += paths[arrayCounter]; | |
9 | } | |
10 | } | |
11 | } | |
12 | } | |
13 | ||
14 | ||
15 | ||
16 | //Method version | |
17 | public static boolean arrayContain(byte[] goodEnd, int p1Counter, int currentPnt){ | |
18 | for (int n = 0; n <=goodEnd.length; n++){ | |
19 | if (goodEnd[p1Counter][n] == currentPnt){ | |
20 | return true; | |
21 | }else {return false;} | |
22 | } | |
23 |