class Solution { public: ListNode* deleteNode(ListNode* head, int val) { ListNode* tmp = head; ListNode* last = head; if(head->val==val) return head->next; tmp = tmp->next; while(tmp){ if(tmp->val==val){ last->nex...