【LeetCode】82. 删除排序链表中的重复元素 II

给定一个排序链表，删除所有含有重复数字的节点，只保留原始链表中 没有重复出现 的数字。

示例 1:

输入: 1->2->3->3->4->4->5
输出: 1->2->5
示例 2:

输入: 1->1->1->2->3
输出: 2->3

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 <script>
			
			function ListNode(val) {
				this.val = val;
				this.next = null;
			}
			
			var deleteDuplicates = function(head) {
			    const map = new Map();
				
				const arr = [];
				while(head != null) {
					arr.push(head.val);
					head = head.next;
				}
				
				for(let val of arr) {
					if(map.has(val)) {
						const cnt = map.get(val);
						map.set(val, cnt+1);
					}
					else {
						map.set(val, 1);
					}
				}
				
				const res = [];
				
				for(let [key, val] of map.entries()) {
					if(val == 1) {
						res.push(key);
					}
				}
				
				let h1 = new ListNode(0);
				const h2 = h1;
				for(let val of res) {
					h1.val = val;
					if(res[res.length-1] == val) {
						break;
					}
					h1.next = new ListNode(0);
					h1 = h1.next;
				}
				
				return h2;
			}
			
			function create(arr) {
				let head = new ListNode(0);
				const h1 = head;
				
				for(let val of arr) {
					head.val = val;
					
					if(arr[arr.length-1] == val) {
						break;
					}
					
					head.next = new ListNode(0);
					head = head.next;
				}
				
				return h1;
			}
			
			const head = create([1,2,3,3,4,4,5]);
			console.log(deleteDuplicates(head));
			
		</script>