摘要: 解 快慢指针 class Solution { public int removeDuplicates(int[] nums) { int pre = nums[0]; int place = 1; for (int i = 1; i < nums.length; i++){ if (nums[i] 阅读全文
posted @ 2024-01-08 21:21 破忒头头 阅读(11) 评论(0) 推荐(0)
摘要: 解 快慢指针 class Solution { public int removeElement(int[] nums, int val) { //快慢指针 int place = 0; //实际插入位置 for (int i = 0; i < nums.length; i++){ if ( num 阅读全文
posted @ 2024-01-08 21:12 破忒头头 阅读(12) 评论(0) 推荐(0)
摘要: 解 class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int[] nums3 = new int[m]; int p = 0; //指向nums3 int q = 0; //指向nums3 int 阅读全文
posted @ 2024-01-08 20:52 破忒头头 阅读(16) 评论(0) 推荐(0)