Gopythor

Code Java // Initialize slow & fast pointers ListNode slow = head; ListNode fast = head; /** * Change this condition to fit specific problem. * Attention: remember to avoid null-pointer error **/ while (slow != null && fast != null && fast.next != null) { slow = slow.next; // move slow pointer one step each time fast = fast.next.next; // move fast pointer two steps each time if (slow == fast) { ..

Go/Leet Code 2022. 5. 1. 23:24

Reconsider the Space Limitation Java public int removeElement(int[] nums, int val) { int k = 0; for (int i = 0; i < nums.length; ++i) { if (nums[i] != val) { nums[k] = nums[i]; k++; } } return k; } Go func removeElement(nums []int, val int) { k := 0; for i:=0; i < nums.length; i++{ if nums[i] != val{ nums[k] = nums[i] k++ } } return k }

Go/Leet Code 2022. 4. 12. 22:34

Reverse the elements in an array. Java public static void reverse(int[] v, int N) { int i = 0; int j = N - 1; while (i < j) { swap(v, i, j); // this is a self-defined function i++; j--; } } GO func reverse(v []int, N int) { var i int = 0 var j = N - 1 for i < j { swap(v, i, j) // this is a self-defined function i++ j-- } }

Go/Leet Code 2022. 4. 9. 17:46