title: 数值的整数次方
date: 2018-3-1 14:18:40
categories:
- 剑指offer
tags:
- Algorithm
- 剑指offer
数值的整数次方
题目描述:
输入一个链表,从尾到头打印链表每个节点的值。
public class 从尾到头打印链表 {
public static void main(String[] args) {
// TODO Auto-generated method stub
}
// 使用堆栈 来逆转打印
public static ArrayList<Integer> printListFromTailToHead(ListNode head) {
if (head == null) {
ArrayList<Integer> list = new ArrayList<>();
return list;
}
Stack<Integer> stack = new Stack<>();
while (head != null ) {
stack.push(head.val);
head = head.next;
}
ArrayList<Integer> res = new ArrayList<>();
while (!stack.isEmpty()) {
Integer item = stack.pop();
System.out.println(item); // 打印
res.add(item);
}
return res;
}
// 递归的方法
public static void printListFromTailToHead2(ListNode head) {
if (head != null) {
if (head.next != null) {
printListFromTailToHead2(head.next);
}
System.out.println(head.val);
}
}
}