There's code in one reply that spells it out, but you might find it easier to start from the bottom up, by asking and answering tiny questions (this is the approach in The Little Lisper): What is the reverse of
Reverse Linked List 1,题目要求 Reverse a singly linked list. 翻转一个单链表。 2,题目思路 对于这道题,是单链表问题的一个非常经典的问题。一般来说,这个问题有两种解决办法:迭代与递归。 迭代: 迭代的方法相对来说比较简单。 我们首先定义一个节点,作为开始节点(NULL),然后在循环的过程中: 记录当前节点的...
First, we need a linked list. Clear your workspace of unwanted xterms, sprinkle salt into the protective form of two parentheses, and recurse. Summon a list from the void.(defn cons [h t] #(if % h t)) “That’s not a list,” the interviewer says. “That’s an if statement.”...
02-线性结构3 Reversing Linked List(25 分) Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; if K=4, you must outpu...
Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 题意:如何判断链表是否有环 这是一个经典的问题,后面还有追问: 如果有环,计算环的长度? 找到碰撞点的位置? 首先,如何找环,设计两个指针,分别从链表的头节点开始,... ...
First, we need a linked list. Clear your workspace of unwanted xterms, sprinkle salt into the protective form of two parentheses, and recurse. Summon a list from the void.(defn cons [h t] #(if % h t)) “That’s not a list,” the interviewer says. “That’s an if statement.”...