zoukankan      html  css  js  c++  java
  • 【leetcode】【单链表】【83】Remove Duplicates from Sorted List

    #include<iostream>
    #include<stack>
    using namespace std;
    
    struct ListNode {
    	int val;
    	ListNode *next;
    	ListNode(int x) : val(x), next(NULL) {}
    };
    
    class Solution {
    public:
    	ListNode* deleteDuplicates(ListNode* head) {
    		if (head == NULL || head->next == NULL)
    			return head;
    		ListNode* temp = NULL;
    		ListNode* cur = head;
    		while (cur->next){
    			if (cur->val == cur->next->val){
    				temp = cur->next;
    				cur->next = temp->next;
    				delete temp;
    			}else
    				cur = cur->next;
    		}
    		return head;
    	}
    	ListNode* createList(ListNode* head){
    		int numOfNode;
    		int value;
    		cout << "please input number of listNode:";
    		cin >> numOfNode;
    		cin >> value;
    		head = new ListNode(value);
    		ListNode* cur = head;
    		for (int i = 1; i < numOfNode; ++i){
    			cin >> value;
    			ListNode* temp = new ListNode(value);
    			cur->next = temp;
    			cur = temp;
    		}
    		return head;
    	}
    	void printNode(ListNode* head){
    		ListNode* cur = head;
    		while (cur){
    			cout << cur->val << " ";
    			cur = cur->next;
    		}
    		cout << endl;
    	}
    };
    
    int main(){
    	ListNode* head = NULL;
    	Solution solution;
    	head = solution.createList(head);
    	solution.printNode(head);
    
    	head = solution.deleteDuplicates(head);
    	solution.printNode(head);
    
    	system("pause");
    	return 0;
    }

  • 相关阅读:
    常用命令
    经典算法
    框架
    计算机网络
    设计模式
    JVM
    数据库
    多线程
    Java中HashMap的底层实现原理
    构建大小顶堆
  • 原文地址:https://www.cnblogs.com/ruan875417/p/4558323.html
Copyright © 2011-2022 走看看