FilesExpand file tree

 master

/

Coding_002.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

42 lines (37 loc) · 915 Bytes

 master

/

Coding_002.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

42 lines (37 loc) · 915 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

//输入一个链表，从尾到头打印链表每个节点的值。

//输入为链表的表头

//输出为需要打印的“新链表”的表头

#include <iostream>

#include <vector>

using namespace std;

struct ListNode {

int val;

struct ListNode *next;

ListNode(int x) :

val(x), next(NULL) {

}

};

class Solution {

private:

vector<int> ans;

public:

vector<int> printListFromTailToHead(struct ListNode* head) {

if(!head)

return ans;

printListFromTailToHead(head->next);

ans.push_back(head->val);

return ans;

}

};

int main()

{

ListNode* head= new ListNode(10);

head->next= new ListNode(30);

head->next->next= new ListNode(40);

Solution a;

vector<int> ans = a.printListFromTailToHead(head);

int sz = ans.size();

for(int i=0;i<sz;i++)

std::cout<<ans[i]<<" ";

return 0;

}