| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 2 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 4 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Java and a next_permutation Related Problem
So I've been working on this problem today in Java. I have code that finds the permutations in the correct order, i.e. A > a > B > b > C > ...
I get Time Limit Exceeded, though. Could anyone make any recommendations on how I could optimize my program? Below is my code. Thanks for reading.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
w0ws0d0gg0 | 2015-11-30 16:41:15 | 330 | ||
| en2 |
|
w0ws0d0gg0 | 2015-11-30 07:29:47 | 4674 | (published) | |
| en1 |
|
w0ws0d0gg0 | 2015-11-30 07:26:04 | 5197 | Initial revision (saved to drafts) |
