LeetCode 203. Remove Linked List Elements 题解 —— Java
2017-03-20 21:54
204 查看
题目链接:https://leetcode.com/problems/remove-linked-list-elements/#/description
题目要求:删除链表中的值为指定值的所有节点
思路:该题的关键是 在head之前增加一个辅助节点,然后使用两个指针,一个previous,一个current,分别用来记录当前处理节点的前一个节点和当前处理节点。
Java代码如下:
public class Solution {
public ListNode removeElements(ListNode head, int val) {
ListNode addNode = new ListNode(0);
addNode.next = head;
ListNode previous = addNode;
ListNode current = head;
while(current != null){
if(current.val == val){
previous.next = current.next;
current = current.next;
} else {
previous = current;
current = current.next;
}
}
return addNode.next;
}
}
题目要求:删除链表中的值为指定值的所有节点
思路:该题的关键是 在head之前增加一个辅助节点,然后使用两个指针,一个previous,一个current,分别用来记录当前处理节点的前一个节点和当前处理节点。
Java代码如下:
public class Solution {
public ListNode removeElements(ListNode head, int val) {
ListNode addNode = new ListNode(0);
addNode.next = head;
ListNode previous = addNode;
ListNode current = head;
while(current != null){
if(current.val == val){
previous.next = current.next;
current = current.next;
} else {
previous = current;
current = current.next;
}
}
return addNode.next;
}
}
相关文章推荐
- [LeetCode] Leetcode 题解索引 (C++/Java/Python/Sql)
- Remove Nth Node From End of List---leetcode 我的java题解
- LeetCode 3. Longest Substring Without Repeating Characters 题解——Java
- LeetCode 96. Unique Binary Search Trees 题解 —— Java
- LeetCode 22. Generate Parentheses 题解 —— Java
- LeetCode题解汇总(C++ Java Python,含题目翻译)
- LeetCode 26. Remove Duplicates from Sorted Array 题解——Java
- leetcode题解Java | 491. Increasing Subsequences
- leetcode题解Java | 148. Sort List
- LeetCode 226. Invert Binary Tree 题解 —— Java
- LeetCode 19之Remove Nth Node From End of List的Java题解(三种解法)
- LEETCODE 7 Reverse Integer (JAVA题解)
- 【leetcode题解】【有问题,python没AC,java却过了】【M】【66】Perfect Squares
- LeetCode 111. Minimum Depth of Binary Tree 题解——Java
- LEETCODE 11 Container With Most Water (JAVA题解)
- Remove Duplicates from Sorted Array---leetcode 我的java题解
- LeetCode242_Valid Anagram(判断两个字符串是不是由完全一样字符组成) Java题解
- LEETCODE 9 Palindrome Number (JAVA题解)
- LeetCode 392. Is Subsequence 题解——Java
- leetcode题解Java | 310. Minimum Height Trees