@@ -0,0 +1,740 @@
+package Part2;%0A%0A/**%0A * Created by matao on 10/16/16.%0A *%0A * Implement an algorithm to delete a node in the middle of a singly linked list,%0A * given only access to that node.%0A *%0A * EXAMPLE%0A * Input: the node c from the linked list a-%3Eb-%3Ec-%3Ed-%3Ee%0A * Result: nothing is returned, but the new linked list looks like a- %3Eb- %3Ed-%3Ee%0A *%0A * %E5%88%A0%E9%99%A4%E5%8D%95%E5%90%91%E9%93%BE%E8%A1%A8%E4%B8%AD%E6%9F%90%E4%B8%AA%E7%BB%93%E7%82%B9%EF%BC%8C%E5%81%87%E5%AE%9A%E4%BD%A0%E5%8F%AA%E8%83%BD%E8%AE%BF%E9%97%AE%E8%AF%A5%E7%BB%93%E7%82%B9%0A */%0Apublic class Q3 %7B%0A%0A    /**%0A     * %E5%B0%86%E5%90%8E%E7%BB%A7%E7%BB%93%E7%82%B9%E7%9A%84%E5%80%BC%E5%A4%8D%E5%88%B6%E7%BB%99%E8%AF%A5%E8%8A%82%E7%82%B9%EF%BC%8C%E7%84%B6%E5%90%8E%E5%88%A0%E9%99%A4%E5%90%8E%E7%BB%A7%E7%BB%93%E7%82%B9%E3%80%82%0A     * %E8%8B%A5%E6%98%AF%E5%B0%BE%E7%BB%93%E7%82%B9%EF%BC%8C%E5%88%99%E6%97%A0%E8%A7%A3%0A     */%0A    public boolean deleteNode(LinkedListNode%3CInteger%3E node) %7B%0A        if (node == null %7C%7C node.next == null) %7B%0A            return false;%0A        %7D%0A%0A        LinkedListNode%3CInteger%3E nextNode = node.next;%0A        node.data = nextNode.data;%0A        node.next = nextNode.next;%0A        return true;%0A    %7D%0A%7D%0A

Add solution of 2-3