Your algorithm is O(N∗M) where: N = size of array. M = steps. It's possible to do an array rotation that's O(N), regardless of the number ...
確定! 回上一頁