Gopythor

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

Given an integer numRows, return the first numRows of Pascal&#39;s triangle. In Pascal&#39;s triangle, each number is the sum of the two numbers directly above it as shown: Example 1: Input: numRows = 5 Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]Example 2: Input: numRows = 1 Output: [[1]]Constraints: 1

Go/Leet Code 2022. 3. 29. 23:01

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

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