代码拉取完成,页面将自动刷新
同步操作将从 光花梗虎耳草/leetcode 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
限制:
0 <= 链表长度 <= 10000
该题需要将链表转换为数组,且需要反向。由于目标是链表,无法第一时间得知长度,声明等长数组。
解题方案:
reverse()
)。# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
res = []
while head:
res.append(head.val)
head = head.next
return res[::-1]
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int[] reversePrint(ListNode head) {
Stack<Integer> s = new Stack<>();
while (head != null) {
s.push(head.val);
head = head.next;
}
int[] res = new int[s.size()];
int i = 0;
while (!s.isEmpty()) {
res[i++] = s.pop();
}
return res;
}
}
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int[] reversePrint(ListNode head) {
if (head == null) return new int[]{};
// 计算链表长度n
int n = 0;
ListNode cur = head;
while (cur != null) {
++n;
cur = cur.next;
}
int[] res = new int[n];
cur = head;
while (cur != null) {
res[--n] = cur.val;
cur = cur.next;
}
return res;
}
}
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @return {number[]}
*/
var reversePrint = function (head) {
let res = [];
while (head != null) {
res.unshift(head.val);
head = head.next;
}
return res;
};
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
//insert to the front
func reversePrint(head *ListNode) []int {
res := []int{}
for head != nil {
res = append([]int{head.Val}, res...)
head = head.Next
}
return res
}
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
vector<int> ret;
void getVal(ListNode* head) {
// 这里可以看成是一个节点的树
if (head) {
if (head->next) {
getVal(head->next);
}
ret.push_back(head->val);
}
}
vector<int> reversePrint(ListNode* head) {
getVal(head);
// 返回的是全局的ret信息。在getVal函数中被赋值
return ret;
}
};
class Solution {
public:
vector<int> reversePrint(ListNode* head) {
stack<int> stk;
vector<int> ans;
ListNode *p = head;
while (p) {
stk.push(p->val);
p = p->next;
}
while (!stk.empty()) {
ans.push_back(stk.top());
stk.pop();
}
return ans;
}
};
/**
* Definition for singly-linked list.
* class ListNode {
* val: number
* next: ListNode | null
* constructor(val?: number, next?: ListNode | null) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
* }
*/
function reversePrint(head: ListNode | null): number[] {
let res: number[] = [];
while (head != null) {
res.unshift(head.val);
head = head.next;
}
return res;
}
// Definition for singly-linked list.
// #[derive(PartialEq, Eq, Clone, Debug)]
// pub struct ListNode {
// pub val: i32,
// pub next: Option<Box<ListNode>>
// }
//
// impl ListNode {
// #[inline]
// fn new(val: i32) -> Self {
// ListNode {
// next: None,
// val
// }
// }
// }
impl Solution {
pub fn reverse_print(head: Option<Box<ListNode>>) -> Vec<i32> {
let mut arr: Vec<i32> = vec![];
let mut cur = head;
while let Some(node) = cur {
arr.push(node.val);
cur = node.next;
}
arr.reverse();
arr
}
}
// Definition for singly-linked list.
// #[derive(PartialEq, Eq, Clone, Debug)]
// pub struct ListNode {
// pub val: i32,
// pub next: Option<Box<ListNode>>
// }
//
// impl ListNode {
// #[inline]
// fn new(val: i32) -> Self {
// ListNode {
// next: None,
// val
// }
// }
// }
impl Solution {
pub fn reverse_print(head: Option<Box<ListNode>>) -> Vec<i32> {
let mut cur = &head;
let mut n = 0;
while let Some(node) = cur {
cur = &node.next;
n += 1;
}
let mut arr = vec![0; n];
let mut cur = head;
while let Some(node) = cur {
n -= 1;
arr[n] = node.val;
cur = node.next;
}
arr
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。