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

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

Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1

Go/Leet Code 2022. 4. 12. 03:39

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

Write a function that reverses a string. The input string is given as an array of characters s. You must do this by modifying the input array in-place with O(1) extra memory. Example 1: Input: s = ["h","e","l","l","o"] Output: ["o","l","l","e","h"] Example 2: Input: s = ["H","a","n","n","a","h"] Output: ["h","a","n","n","a","H"] Constraints: 1

Go/Leet Code 2022. 4. 9. 18:27

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

Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: strs = ["flower","flow","flight"] Output: "fl" Example 2: Input: strs = ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings. Constraints: 1

Go/Leet Code 2022. 4. 8. 00:49