2021年12月17日
[LeetCode] 1269. Number of Ways to Stay in the Same Place After Some Steps 停在原地的方案数
摘要： You have a pointer at index 0 in an array of size arrLen. At each step, you can move 1 position to the left, 1 position to the right in the array, or 阅读全文
posted @ 2021-12-17 16:35 Grandyang 阅读(414) 评论(0) 推荐(0) 编辑
Fork me on GitHub