双指针
Leeli9316
这个作者很懒,什么都没留下…
展开
-
2022.03.30(LC_2024_考试的最大困扰度)
方法:滑动窗口class Solution { public int maxConsecutiveAnswers(String answerKey, int k) { return Math.max(maxConsecutiveChar(answerKey, 'T', k), maxConsecutiveChar(answerKey, 'F', k)); } public int maxConsecutiveChar(String answerKey, c...原创 2022-03-30 15:45:48 · 108 阅读 · 0 评论 -
2022.03.21(LC_18_四数之和)
方法一:暴力求解class Solution { public List<List<Integer>> fourSum(int[] nums, int target) { List<List<Integer>> res = new ArrayList<>(); if (nums.length < 4) return res; Arrays.sort(nums); ...原创 2022-03-21 16:19:00 · 173 阅读 · 0 评论 -
2022.03.19(LC_15_三数之和)
方法以:排序+Set去重class Solution { public List<List<Integer>> threeSum(int[] nums) { Arrays.sort(nums); Set<List<Integer>> res = new HashSet<>(); for (int i = 0; i < nums.length; i++) { ...原创 2022-03-19 11:02:49 · 118 阅读 · 0 评论 -
2022.03.17(LC_142_环形链表Ⅱ)
方法一:哈希表/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Solution { public ListNode detectCycle(L..原创 2022-03-17 11:15:47 · 168 阅读 · 0 评论 -
2022.03.16(LC_141_环形链表)
方法一:哈希表/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Solution { public boolean hasCycle(List...原创 2022-03-16 17:01:17 · 50 阅读 · 0 评论 -
2022.03.16(LC_160_相交链表)
方法一:哈希表/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Solution { public ListNode getInt..原创 2022-03-16 16:18:57 · 727 阅读 · 0 评论 -
2022.03.15(LC_19_删除链表的倒数第 N 个结点)
方法一:两趟扫描/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next =...原创 2022-03-15 16:47:26 · 304 阅读 · 0 评论 -
2022.03.14(LC_206_反转链表)
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next = next; }...原创 2022-03-14 17:41:09 · 1560 阅读 · 0 评论 -
2022.03.10(LC_27_移除元素)
方法一解题思路: 遍历数组,将非val值从初始位置0开始存储。(在最坏情况下(输入数组中没有元素等于 val),左右指针各遍历了数组一次)class Solution { public int removeElement(int[] nums, int val) { int i = 0; for (int num : nums) { if (num != val) { nums[i++] = num;..原创 2022-03-10 11:09:31 · 38 阅读 · 0 评论