feat: update ts solution to lc problem: No.0141 (doocs#1349)

Author: thinkasany

solution/0100-0199/0141.Linked List Cycle/README.md

@@ -200,7 +200,7 @@ func hasCycle(head *ListNode) bool {
 function hasCycle(head: ListNode | null): boolean {
     const set = new Set<ListNode>();
     let node = head;
-    while (node != null) {
+    while (node !== null) {
         if (set.has(node)) {
             return true;
         }
@@ -227,7 +227,7 @@ function hasCycle(head: ListNode | null): boolean {
 function hasCycle(head: ListNode | null): boolean {
     let slow = head;
     let fast = head;
-    while (fast != null && fast.next != null) {
+    while (fast !== null && fast.next !== null) {
         slow = slow.next;
         fast = fast.next.next;
         if (slow === fast) {

solution/0100-0199/0141.Linked List Cycle/README_EN.md

@@ -169,7 +169,7 @@ func hasCycle(head *ListNode) bool {
 function hasCycle(head: ListNode | null): boolean {
     const set = new Set<ListNode>();
     let node = head;
-    while (node != null) {
+    while (node !== null) {
         if (set.has(node)) {
             return true;
         }
@@ -196,7 +196,7 @@ function hasCycle(head: ListNode | null): boolean {
 function hasCycle(head: ListNode | null): boolean {
     let slow = head;
     let fast = head;
-    while (fast != null && fast.next != null) {
+    while (fast !== null && fast.next !== null) {
         slow = slow.next;
         fast = fast.next.next;
         if (slow === fast) {

solution/0100-0199/0141.Linked List Cycle/Solution.ts

@@ -13,7 +13,7 @@
 function hasCycle(head: ListNode | null): boolean {
     let slow = head;
     let fast = head;
-    while (fast != null && fast.next != null) {
+    while (fast !== null && fast.next !== null) {
         slow = slow.next;
         fast = fast.next.next;
         if (slow === fast) {