JavaArithmetic/src/datastructure/recursion/Solution.java at master · wangguofei/JavaArithmetic · GitHub

Repository navigation

History

package datastructure.recursion;

public class Solution {

public ListNode removeElements(ListNode head, int val, int depth) {

String depthString = generateDepthString(depth);

System.out.print(depthString);

System.out.println("Call: remove " + val + " in " + head);

if(head == null){

System.out.print(depthString);

System.out.println("Return: " + head);

return head;

}

ListNode res = removeElements(head.next, val, depth + 1);

System.out.print(depthString);

System.out.println("After remove " + val + ": " + res);

ListNode ret;

if(head.val == val)

ret = res;

else{

head.next = res;

ret = head;

}

System.out.print(depthString);

System.out.println("Return: " + ret);

return ret;

}

private String generateDepthString(int depth){

StringBuilder res = new StringBuilder();

for(int i = 0 ; i < depth ; i ++)

res.append("--");

return res.toString();

}

public static void main(String[] args) {

int[] nums = {1, 2, 6, 3, 4, 5, 6};

ListNode head = new ListNode(nums);

System.out.println(head);

ListNode res = (new Solution()).removeElements(head, 6, 0);

System.out.println(res);

}

JavaArithmetic/src/datastructure/recursion/Solution.java at master · wangguofei/JavaArithmetic · GitHub

Repository navigation

Expand file tree

Breadcrumbs

Solution.java

Latest commit

History

Breadcrumbs

Solution.java

File metadata and controls