Array题型:双指针Two Pointers套路

一、反向

 

通用步骤:

  1. Initialize two pointer i = 0, j = array.length - 1
  2. while i <= j: 
    • Decide what you should do based on the value of array[i] and array[j]
    • Move at least one pointer forward in its direction

二、同向

通用步骤:

  1. Initialize two pointers i and j, usually both equal to 0
  2. while i < array.length:
    1. if we need array[i], then we keep it by assigning array[i] = array[j], and move i forward, make it ready at the next position
    2. otherwise skip it. We do not need to move i since its spot is not fulfilled
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值