算法编码技巧

递归书写方法

1. 链表创建

public class Node {
   

    private final int value;

    private Node next;

    public Node(int value) {
   
        this.value = value;
        this.next = null;
    }

private Node create(List<Integer> linkedList){
   
        if (linkedList.size() == 0){
   
            return null;
        }
        Node nodeFirst = new Node(linkedList.get(0));
        nodeFirst.setNext(create(linkedList.subList(1,linkedList.size())));
        return nodeFirst;
    }

2. 链表反转

private Node reverseListedList(Node head){
   
        if (head == null || head.getNext() == null){
   
            return head;
        }
        //将1号节点以后的链表反转
        Node newHead = reverseListedList(head.getNext());
        //以后的链表的下一个指向头节点
        head