/*
 * Copyright (C) 2014 Pedro Vicente Gómez Sánchez.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.github.pedrovgs.problem59;

/**
 * Implement an algorithm to delete a node in the middle of a singly linked list, given only access
 * to that node.
 *
 * @author Pedro Vicente Gómez Sánchez.
 */
public class DeleteListNode {

}

@@ -645,16 +645,65 @@
 lem59;%0A%0A
+import com.github.pedrovgs.linkedlist.ListNode;%0A%0A
 /**%0A * I
@@ -893,10 +893,860 @@
 Node %7B%0A%0A
+  /**%0A   * Iterative algorithm to solve this problem. We don't have access to the head of the list, and%0A   * the only thing we can do is to move the data from the next node to the current one, the data%0A   * and the pointer to the next node. This approach doesn't work with the last element in the%0A   * list, but there is no another valid approach to solve this algorithm without access to the%0A   * head of the list.%0A   */%0A  public void delete(ListNode node) %7B%0A    validateInputData(node);%0A%0A    if (node.getNext() == null) %7B%0A      return;%0A    %7D%0A    ListNode next = node.getNext();%0A    node.setData(next.getData());%0A    node.setNext(next.getNext());%0A  %7D%0A%0A  private void validateInputData(ListNode node) %7B%0A    if (node == null) %7B%0A      throw new IllegalArgumentException(%0A          %22You can't pass a null instance of ListNode as parameter.%22);%0A    %7D%0A  %7D%0A
 %7D%0A

Add solution to problem 59