Gopythor

You are given an integer array nums where the largest integer is unique. Determine whether the largest element in the array is at least twice as much as every other number in the array. If it is, return the index of the largest element, or return -1 otherwise. Example 1: Input: nums = [3,6,1,0] Output: 1 Explanation: 6 is the largest integer. For every other number in the array x, 6 is at least ..

Go/Leet Code 2022. 3. 24. 18:32

Given an array of integers nums, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly to the index's right. If the index is on the left edge of the array, then the left sum is 0 because there are no elements to the left. This also applies to the right edge of the ar..

Go/Leet Code 2022. 3. 24. 00:37

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

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 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