{"topic":{"id":13327,"title":"LC rotate-array hint 看不懂","slug":"topic","userId":4668,"categoryId":4,"createdAt":"2024-08-29 15:40:02.138052","bumpedAt":"2024-08-29 15:53:42.215248","views":165,"postsCount":3,"highestPostNumber":3,"likeCount":1,"closed":false,"pinned":false,"pinnedGlobally":false,"pinnedAt":null,"pinnedUntil":null,"isBanner":false,"excerpt":"189. Rotate Array Medium Given an integer array nums, rotate the array to the right by k steps, where k is non-negative. 题目很简单，就是这一段没看懂： Hint 4 The other line of thought is a tad bit complicated but essentially it builds…","deletedAt":null,"isAnonymous":false,"isPrivate":false,"isMembersOnly":false,"category":{"id":4,"name":"谈笑风生","slug":"general","color":"25AAE2"},"author":{"id":4668,"username":"IO","name":null,"avatarUrl":null},"realAuthor":{"id":4668,"username":"IO","name":null,"avatarUrl":null},"tags":[]},"posts":[{"id":39251,"postNumber":1,"raw":"\n[189. Rotate Array](https://leetcode.com/problems/rotate-array/)\n\nMedium\n\n\nGiven an integer array `nums`, rotate the array to the right by `k` steps, where `k` is non-negative.\n\n题目很简单，就是这一段没看懂：\n\nHint 4\n\nThe other line of thought is a tad bit complicated but essentially it builds on the idea of placing each element in its original position while keeping track of the element originally in that position. Basically, at every step, we place an element in its rightful position and keep track of the element already there or the one being overwritten in an additional variable. We can't do this in one linear pass and the idea here is based on **cyclic-dependencies** between elements.","cooked":"

Medium

Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.

题目很简单，就是这一段没看懂：

Hint 4

The other line of thought is a tad bit complicated but essentially it builds on the idea of placing each element in its original position while keeping track of the element originally in that position. Basically, at every step, we place an element in its rightful position and keep track of the element already there or the one being overwritten in an additional variable. We can't do this in one linear pass and the idea here is based on cyclic-dependencies between elements.

\n","createdAt":"2024-08-29 15:40:02.408618","updatedAt":"2024-12-22 15:27:33.443843","replyToPostNumber":null,"replyCount":0,"likeCount":0,"wordCount":121,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"foldedAt":null,"isAnonymous":false,"isOwner":false,"user":{"id":4668,"username":"IO","name":null,"avatarUrl":null,"admin":true,"moderator":false,"signatureRaw":"","signatureCooked":null}},{"id":39252,"postNumber":2,"raw":"赋值时候会覆盖，需要引入额外的辅助变量进行存储","cooked":"

赋值时候会覆盖，需要引入额外的辅助变量进行存储

\n","createdAt":"2024-08-29 15:42:10.44603","updatedAt":"2024-08-29 15:42:10.44603","replyToPostNumber":null,"replyCount":0,"likeCount":1,"wordCount":23,"liked":false,"bookmarked":false,"polls":[],"reactions":[{"reaction":"❤️","count":1,"users":[{"id":4668,"username":"IO","name":null}],"hasReacted":false}],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"foldedAt":null,"isAnonymous":false,"isOwner":false,"user":{"id":4668,"username":"IO","name":null,"avatarUrl":null,"admin":true,"moderator":false,"signatureRaw":"","signatureCooked":null}},{"id":39255,"postNumber":3,"raw":"主要是不懂这个地方的 cyclic-dependencies","cooked":"

主要是不懂这个地方的 cyclic-dependencies

\n","createdAt":"2024-08-29 15:53:42.215248","updatedAt":"2024-08-29 15:53:42.215248","replyToPostNumber":null,"replyCount":0,"likeCount":0,"wordCount":11,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"foldedAt":null,"isAnonymous":false,"isOwner":false,"user":{"id":4668,"username":"IO","name":null,"avatarUrl":null,"admin":true,"moderator":false,"signatureRaw":"","signatureCooked":null}}],"hasMore":false,"lastReadPostNumber":1,"hasUrlPostNumber":false}