LIST_model.cpp

#include<iostream>
#include<string>
#include<vector>
#include <cctype>
#include<algorithm>
#include<math.h>
using namespace std ;
typedef struct ListNode{
	int val;
	ListNode * next;
} ListNode;
class Solution {
public:
	int threeSumClosest(vector<int> &num, int target) {
	
	}

    void print()
    {
		vector<vector <int> > x;
		vector<int> y;
		y.push_back(-1);
		y.push_back(2);
		y.push_back(1);
		y.push_back(-4);
		int p=threeSumClosest(y,1);
		cout<<p<<endl;
//		y.push_back(2);
		//x.push_back(y);
		int P[13]={0,1,0,2,1,0,1,3,2,1,2,1};
		int Q[4]={4,2,3};
		int M[11]={5,5,1,7,1,1,5,2,7,6};
//		isValid("[({(())}[()])]");

		ListNode *A,*B,*C,*D,*E,*F,*res;
		A=(ListNode*)malloc(sizeof(ListNode));
		B=(ListNode*)malloc(sizeof(ListNode));
		C=(ListNode*)malloc(sizeof(ListNode));
		D=(ListNode*)malloc(sizeof(ListNode));
		E=(ListNode*)malloc(sizeof(ListNode));
		F=(ListNode*)malloc(sizeof(ListNode));

		A->val=1;
		B->val=4;
		C->val=3;
		D->val=2;
		E->val=5;
		F->val=2;
		A->next=B;
		B->next=C;
		C->next=D;
		D->next=E;
		E->next=F;
		F->next=NULL;
//		D->next=NULL;
//		res=partition(A,3);
//		for(res;res;res=res=res->next)
//			cout<<res->val<<" ";
//		cout<<endl;

		
		//cout<<trailingZeroes(625)<<endl;
		//cout<<x.size()<<endl;
	}
};
int main()
{
	Solution test;

//	cout<<test.Low("A man, a plan, a canal: Panama")<<endl;
	test.print();
//	cout<<atoi("2147483648")<<endl;
	system("pause");
}