双指针法降低时间复杂度-LeetCode相关题目
双指针法降低时间复杂度:O(n^2)优化为 O(n),O(n3)优化为O(n2),O(n4)优化为O(n3),以此类推。也就是降一个数量级,题目如下:
- 27.移除元素(opens new window)
- 15.三数之和(opens new window)
- 18.四数之和(opens new window)
链表相关双指针题目:
- 206.反转链表(opens new window)
- 19.删除链表的倒数第N个节点(opens new window)
- 面试题 02.07. 链表相交(opens new window)
- 142题.环形链表II(opens new window)
字符串相关双指针题目:
- 344.反转字符串