目录结构
1.题目
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例:
输入:head = [1,3,2]
输出:[2,3,1]
限制:
0 <= 链表长度 <= 10000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2.题解
栈或递归。
public class Offer06 {
@Test
public void test() {
ListNode head = new ListNode(5);
head.next = new ListNode(4);
head.next.next = new ListNode(3);
System.out.println(Arrays.toString(reversePrint1(head)));
}
public int[] reversePrint1(ListNode head) {
Stack<Integer> stack = new Stack<>();
while (head != null) {
stack.push(head.val);
head = head.next;
}
int[] result = new int[stack.size()];
for (int i = 0; i < result.length; i++) {
result[i] = stack.pop();
}
return result;
}
List<Integer> tmp = new ArrayList<>();
public int[] reversePrint(ListNode head) {
helper(head);
int[] result = new int[tmp.size()];
for (int i = 0; i < tmp.size(); i++) {
result[i] = tmp.get(i);
}
return result;
}
public void helper(ListNode head) {
if (head != null) {
helper(head.next);
tmp.add(head.val);
}
}
}
- 时间复杂度:
- 空间复杂度: