/*********************************************************************************
  *Copyright (c)    2021   xldeng
  *FileName:        header.h
  *Author:          xldeng
  *Version:         1.0
  *Date:            2021/2/8 23:04
  *Description:     
  *Others:          
  *Function List:   
     1.…………
  *History:  
     1.Date:
       Author:
       Modification:
**********************************************************************************/

#ifndef LEETCODE_HEADER_H
#define LEETCODE_HEADER_H

#include <vector>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include "binary_tree/tree_node.h"
#include <climits>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
using namespace std;

struct ListNode {
    int val;
    ListNode *next;

    ListNode(int x) : val(x), next(NULL) {}
};

#endif //LEETCODE_HEADER_H