Commit f5268ee

xiaofei-2020 xiaofei-2020

committed

添加(0141.环形链表.md):增加typescript版本

1 parent 9c32528 commit f5268eeCopy full SHA for f5268ee

File tree

1 file changed

+20

-1

lines changed

problems
- 0141.环形链表.md

1 file changed

+20

-1

lines changed

`‎problems/0141.环形链表.md‎`

Lines changed: 20 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -7,6 +7,8 @@`
`7`	`7`
`8`	`8`	`# 141. 环形链表`
`9`	`9`
	`10`	`+[力扣题目链接](https://leetcode.cn/problems/linked-list-cycle/submissions/)`
	`11`	`+`
`10`	`12`	`给定一个链表,判断链表中是否有环。`
`11`	`13`
`12`	`14`	`如果链表中有某个节点,可以通过连续跟踪 next 指针再次到达,则链表中存在环。为了表示给定链表中的环,我们使用整数 pos 来表示链表尾连接到链表中的位置(索引从 0 开始)。如果 pos 是 -1,则在该链表中没有环。注意:pos 不作为参数进行传递,仅仅是为了标识链表的实际情况。`
`@@ -103,7 +105,7 @@ class Solution:`
`103`	`105`	`return False`
`104`	`106`	```
`105`	`107`
`106`		`-## Go`
	`108`	`+### Go`
`107`	`109`
`108`	`110`	```go
`109`	`111`	`func hasCycle(head *ListNode) bool {`
`@@ -139,6 +141,23 @@ var hasCycle = function(head) {`
`139`	`141`	`};`
`140`	`142`	```
`141`	`143`
	`144`	`+### TypeScript`
	`145`	`+`
	`146`	+```typescript
	`147`	`+function hasCycle(head: ListNode \| null): boolean {`
	`148`	`+ let slowNode: ListNode \| null = head,`
	`149`	`+ fastNode: ListNode \| null = head;`
	`150`	`+ while (fastNode !== null && fastNode.next !== null) {`
	`151`	`+ slowNode = slowNode!.next;`
	`152`	`+ fastNode = fastNode.next.next;`
	`153`	`+ if (slowNode === fastNode) return true;`
	`154`	`+ }`
	`155`	`+ return false;`
	`156`	`+};`
	`157`	+```
	`158`	`+`
	`159`	`+`
	`160`	`+`
`142`	`161`
`143`	`162`	`-----------------------`
`144`	`163`	`<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit f5268ee

File tree

1 file changed

1 file changed

`‎problems/0141.环形链表.md‎`

0 commit comments