字符串反转和反转链表

1、字符串反转

public class Main {
    public static void main(String[] args) {
        String s = "hello";
        String res = "";
        for (int i = 0; i < s.length();i++) {
            res = s.charAt(i) + res;
        }
        System.out.println(res);
    }
}

2、反转链表

package Sort;



public class Main {
    public static void main(String[] args) {
        Node n = new Node(3);
        n.next = new Node(2);
        n.next.next = new Node(5);
        System.out.println(reverse(n));

    }

    public static Node reverse(Node node){
       Node prior = null;
       Node cur = node;
       while (cur.next != null) {
           Node t = cur.next;
           cur.next = prior;
           prior = cur;
           cur = t;
       }
       cur.next = prior;
       return cur;

    }
}
class Node{
    int val;
    Node next;

    public Node(int val) {
        this.val = val;
    }
    public Node() {
    }

    @Override
    public String toString() {
        return "Node{" +
                "val=" + val +
                ", next=" + next +
                '}';
    }
}