Leetcode刷题-206反转链表

#include<iostream>
using namespace std;

//Definition for singly-linked list.
struct ListNode {
    int val;
    ListNode *next;
    ListNode() : val(0), next(nullptr) {}
    ListNode(int x) : val(x), next(nullptr) {}
    ListNode(int x, ListNode *next) : val(x), next(next) {}
};

class Solution {
public:
	ListNode* reverseList(ListNode* head) {
		ListNode *pre = head;
		ListNode *cur = NULL;
		while (pre != NULL)
		{
			ListNode *temp = pre->next;
			pre->next = cur;
			cur = pre;
			pre = temp;
		}
		return cur;
	}
};

ListNode* NUM(char num[], int size) {
	ListNode *L1 = new ListNode(NULL);
	ListNode *pre = L1;
	for (int i = 0; i < size; i++)
	{
		ListNode *p = new ListNode(NULL);
		p->val = num[i];

		pre->next = p;
		pre = p;
		p->next = NULL;
	}
	
	return L1->next;
}

void print(ListNode *L, int size) {

	for (int i = 0; i < size; i++)
	{
		cout << L->val << endl;
		L = L->next;
	}
}

void test01() {
	char num[] = { 1,2,6,3,4,5,6 };
	int m_size = sizeof(num);
	ListNode *L1 = NUM(num, m_size);

	Solution S;
	ListNode *L2 = S.reverseList(L1);
	print(L2, m_size);
}

int main()
{
	test01();
	system("pause");
	return 0;
}