Gopythor

Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed. Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements..

Go/Leet Code 2022. 3. 15. 19:47

Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers. Return any array that satisfies this condition. Example 1: Input: nums = [3,1,2,4] Output: [2,4,3,1] Explanation: The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.Example 2: Input: nums = [0] Output: [0]Constraints: 1

Go/Leet Code 2022. 3. 15. 01:45

The Pipeline Pattern https://blog.golang.org/pipelines A concurrent pattern A series of 'stages' connected by channels Each stage is a group of goroutines running the same function So what is the pipeline design pattern and detailed article covering the pattern can be found in the link shown here. Pipeline is a design pattern that makes have used of go's concurrency. And devides code..

Go/Mastering Go 2022. 3. 11. 00:50

Go Concurrency Composition of multiple independent operations. Goroutine : An independently executed function, launched by the goroutine. Goroutines are cheap threads, but not reaparallel. Go channel : A way for goroutines to communicate. Go channels block till data is sent. Buffered Go channels block only when the buffer is full. So let's take a refresher into how concurrency works in Go. Concu..

Go/Mastering Go 2022. 3. 11. 00:29

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array. Example 1: Input: nums = [0,1,0,3,12] Output: [1,3,12,0,0] Example 2: Input: nums = [0] Output: [0] Constraints: 1

Go/Leet Code 2022. 3. 10. 20:20

Code Java public int removeDuplicates(int[] nums) { // Check for edge cases. if (nums == null) { return 0; } // Use the two pointer technique to remove the duplicates in-place. // The first element shouldn&#39;t be touched; it&#39;s already in its correct place. int writePointer = 1; // Go through each element in the Array. for (int readPointer = 1; readPointer < nums.length; readPointer++) { //..

Go/Leet Code 2022. 3. 10. 17:27

My code func removeDuplicates(nums []int) int { if nums == nil { return 0 } k := 0 for _, v := range nums { if v != nums[k] { k++ nums[k] = v } } return k + 1 } I used for loop value output. It starts from array[0]. So if it will be different with value, k will be increased and value will be input there. Simple Code. sample 0 ms submission func removeDuplicates(nums []int) int { if len(nums) < 2..

Go/Leet Code 2022. 3. 6. 22:00

The nested loop Code Java class Solution { public int removeDuplicates(int[] nums) { // The initial length is simply the capacity. int length = nums.length; // Assume the last element is always unique. // Then for each element, delete it iff it is // the same as the one after it. Use our deletion // algorithm for deleting from any index. for (int i = length - 2; i >= 0; i--) { if (nums[i] == num..

Go/Leet Code 2022. 3. 6. 20:14