Gopythor

Operations in Dynamic Array https://leetcode.com/explore/learn/card/array-and-string/201/introduction-to-array/1146/ In Java it will be called list, in go we call slice. Java // "static void main" must be defined in a public class. public class Main { public static void main(String[] args) { // 1. initialize List v0 = new ArrayList(); List v1; // v1 == null // 2. cast an array to a vector Intege..

Go/Leet Code 2022. 3. 23. 15:44

Operations in Array https://leetcode.com/explore/learn/card/array-and-string/201/introduction-to-array/1143/ Java // "static void main" must be defined in a public class. public class Main { public static void main(String[] args) { // 1. Initialize int[] a0 = new int[5]; int[] a1 = {1, 2, 3}; // 2. Get Length System.out.println("The size of a1 is: " + a1.length); // 3. Access Element System.out...

Go/Leet Code 2022. 3. 22. 16:47

Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order. Example 1: Input: nums = [-4,-1,0,3,10] Output: [0,1,9,16,100] Explanation: After squaring, the array becomes [16,1,0,9,100]. After sorting, it becomes [0,1,9,16,100].Example 2: Input: nums = [-7,-3,2,3,11] Output: [4,9,9,49,121]Constraints: 1 0 { return x } r..

Go/Leet Code 2022. 3. 21. 04:12

Hydrachat.go package hydrachat import ( "fmt" "net" "os" "os/signal" "syscall" "github.com/gopythor/udemy/Hydra/hlogger" ) var logger = hlogger.GetInstance() //Start hydra chat func Run(conneciton string) error { l, err := net.Listen("tcp", connection) r := CreateRoom("HydraChat") if err != nil { logger.Println("Error connection to chat client", err) return err } go func() { //Handle SIGINT and ..

Go/Mastering Go 2022. 3. 20. 05:21

Given an array nums of n integers where nums[i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums. Example 1: Input: nums = [4,3,2,7,8,2,3,1] Output: [5,6]Example 2: Input: nums = [1,1] Output: [2]Constraints: n == nums.length 1 0 { missing = append(missing, i+1) } } return missing } func abs(x int) int { if x > 0 { return x } return -x }s..

Go/Leet Code 2022. 3. 19. 22:49

Given an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number. Example 1: Input: nums = [3,2,1] Output: 1 Explanation: The first distinct maximum is 3. The second distinct maximum is 2. The third distinct maximum is 1. Example 2: Input: nums = [1,2] Output: 2 Explanation: The first distinct maximum is 2. The se..

Go/Leet Code 2022. 3. 19. 17:18

A school is trying to take an annual photo of all the students. The students are asked to stand in a single file line in non-decreasing order by height. Let this ordering be represented by the integer array expected where expected[i] is the expected height of the ith student in line. You are given an integer array heights representing the current order that the students are standing in. Each hei..

Go/Leet Code 2022. 3. 17. 22:04

QuickSort Divide and conquer algorithm After determining the pivot, the position of the pivot is confirmed and aligned Quicksort has many variations based on pivot. When comparing numbers, the pivot is the standard. The speed varies depending on the position of the pivot. There are left pivot, right pivot, middle pivot, and random pivot. O(n²) in the worst case Range, Criteria, Compare, Swap qui..

Go/Study record 2022. 3. 17. 18:44