From 63ddf9e75100fe08dc22af75b13f6fc88d234cdb Mon Sep 17 00:00:00 2001 From: char <110567531+char-adadev@users.noreply.github.com> Date: Wed, 7 Sep 2022 11:31:04 -0700 Subject: [PATCH 1/2] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 18e0461..6d970a3 100644 --- a/README.md +++ b/README.md @@ -16,7 +16,7 @@ The following two linked lists do _not_ intersect at all because while the node `linked_list_b: 1 -> 2 -> 5 -> 4 -> 3` -Thereare no cycles anywhere in the linked list structures. Assume any intersection includes the tails of each list. +There are no cycles anywhere in the linked list structures. Assume any intersection includes the tails of each list. The linked lists must retain their original structure after the function returns. From 8aa90f4a30bc0b168e63f82fdb271b6088a03a12 Mon Sep 17 00:00:00 2001 From: Kyra Patton Date: Tue, 13 Sep 2022 09:33:09 -0700 Subject: [PATCH 2/2] Update readme to clarify second example --- README.md | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 18e0461..d70ab98 100644 --- a/README.md +++ b/README.md @@ -9,15 +9,14 @@ For example, the following two linked lists begin to intersect at 5. `linked_list_b: 1 -> 2 -> 5 -> 6 -> 7` +There are no cycles anywhere in the linked list structures. -The following two linked lists do _not_ intersect at all because while the node with value 5 is in the same place, the subsequent nodes are different. +Assume any intersection includes the tails of each list. For example, the following scenario would _not_ occur because while the node with value 5 is in the same place, the subsequent nodes are different. `linked_list_a: 3 -> 4 -> 5 -> 6 -> 7` `linked_list_b: 1 -> 2 -> 5 -> 4 -> 3` -Thereare no cycles anywhere in the linked list structures. Assume any intersection includes the tails of each list. - The linked lists must retain their original structure after the function returns.