Commit 36d0087

committed

add q61

1 parent b635995 commit 36d0087Copy full SHA for 36d0087

File tree

+73

-30

lines changed

+73

-30

lines changed

Lines changed: 31 additions & 30 deletions

Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,6 +10,7 @@`
`10`	`10`
`11`	`11`	`* [q2_两数相加](/src/链表操作/q2_两数相加)`
`12`	`12`	`* [q19_删除链表的倒数第N个节点](/src/链表操作/q19_删除链表的倒数第N个节点)`
	`13`	`+* [q61_旋转链表](/src/链表操作/q61_旋转链表)`
`13`	`14`	`* [q138_复制带随机指针的链表](/src/链表操作/q138_复制带随机指针的链表)`
`14`	`15`	`* [q206_反转链表](/src/链表操作/q206_反转链表)`
`15`	`16`

Lines changed: 10 additions & 0 deletions

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+package 链表操作.q61_旋转链表;`
	`2`	`+`
	`3`	`+/**`
	`4`	`+ * 先连接成环再找断点 o(n)`
	`5`	`+ */`
	`6`	`+public class Solution {`
	`7`	`+`
	`8`	`+ public ListNode rotateRight(ListNode head, int k) {`
	`9`	`+ if (head == null) {`
	`10`	`+ return null;`
	`11`	`+ }`
	`12`	`+ if (head.next == null) {`
	`13`	`+ return head;`
	`14`	`+ }`
	`15`	`+`
	`16`	`+ ListNode oldTail = head;`
	`17`	`+ int n;`
	`18`	`+ for (n = 1; oldTail.next != null; n++) {`
	`19`	`+ oldTail = oldTail.next;`
	`20`	`+ }`
	`21`	`+ oldTail.next = head;`
	`22`	`+ ListNode newTail = head;`
	`23`	`+ for (int i = 0; i < n - k % n - 1; i++) {`
	`24`	`+ newTail = newTail.next;`
	`25`	`+ }`
	`26`	`+ ListNode newHead = newTail.next;`
	`27`	`+ newTail.next = null;`
	`28`	`+`
	`29`	`+ return newHead;`
	`30`	`+ }`
	`31`	`+}`

Comments

(0)