I hereby claim:
- I am Ceva24 on github.
- I am ceva24 (https://keybase.io/ceva24) on keybase.
- I have a public key whose fingerprint is 917C DAF9 077F 2438 D9CE 04AD 0A23 3DBB 34FA D805
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
| def rng = new Random() | |
| def blocks = ['T', 'I', 'L', 'J', 'S', 'Z', 'O'] | |
| def history = ['Z', 'Z', 'S', 'S'] as ArrayDeque | |
| def first = true | |
| def nextPiece = { | |
| def block |
| def rng = new Random() | |
| def blocks = ['T', 'I', 'L', 'J', 'S', 'Z', 'O'] | |
| def history = ['Z', 'S', 'Z', 'S'] as ArrayDeque | |
| def maxTilePosition = 4 | |
| def nextPiece = { | |
| def block |
| import java.util.ArrayList; | |
| class Solution | |
| { | |
| public int solution(int[] H) | |
| { | |
| // rules | |
| /* | |
| * so when we find two indices that are of the same height, we can use the same block, providing all the values in-between are higher. | |
| * |