Gopythor

Given an array, rotate the array to the right by k steps, where k is non-negative. Example 1: Input: nums = [1,2,3,4,5,6,7], k = 3 Output: [5,6,7,1,2,3,4] Explanation: rotate 1 steps to the right: [7,1,2,3,4,5,6] rotate 2 steps to the right: [6,7,1,2,3,4,5] rotate 3 steps to the right: [5,6,7,1,2,3,4] Example 2: Input: nums = [-1,-100,3,99], k = 2 Output: [3,99,-1,-100] Explanation: rotate 1 ste..

Go/Leet Code 2022. 4. 14. 01:33

Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray [numsl, numsl+1, ..., numsr-1, numsr] of which the sum is greater than or equal to target. If there is no such subarray, return 0 instead. Example 1: Input: target = 7, nums = [2,3,1,2,4,3] Output: 2 Explanation: The subarray [4,3] has the minimal length under the problem co..

Go/Leet Code 2022. 4. 13. 16:52

import "sort" func min(x,y int) int{ if x < y { return x } return y } func arrayPairSum(nums []int) int { answer := 0 sort.Slice(nums, func(i,j int) bool { return nums[i] < nums[j] }) //fmt.Printf("%v\n", nums) for i := 0; i < len(nums); i+=2 { answer += min(nums[i], nums[i+1]) } return answer } Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), .....

Go/Leet Code 2022. 4. 10. 02:56

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

My code func findDiagonalOrder(mat [][]int) []int { m, n := len(mat), len(mat[0]) result := make([]int, m*n) row, col, d := 0, 0, 1 for i := 0; i = m { row = m - 1 col += 2 d = -d } if col >= n { col = n - 1 row += 2 d = -d } if row < 0 { row = 0 d = -d } if col < 0 { col = 0 d = -d } } return result } This code is like walking pat..

Go/Leet Code 2022. 3. 27. 22:56

You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0&#39;s. Increment the large integer by one and return the resulting array of digits. Example 1: Input: digits = [1,2,3] Output: [1,2,4] ..

Go/Leet Code 2022. 3. 26. 05:43

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