Day 3 Linkedlist 1 P707,P206

Problem 707 is very trivial, takes time to consider. Get to familiarize with the structure of basics functions in Linkedlist
Problem 206 is typical as it uses double pointer, I shouldn't get it wrong. Remember to document the node you will use, you can't track cur.next if you don't create a new ListNode tmp, the cur already points to the pre.
Know how to write it in recursive way,very important
递归反转链表:拆解复杂问题 | 肖庆都的博客

  • 9
    点赞
  • 7
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值