Gopythor

Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers directly above it as shown: Example 1: Input: rowIndex = 3 Output: [1,3,3,1] Example 2: Input: rowIndex = 0 Output: [1] Example 3: Input: rowIndex = 1 Output: [1,1] Constraints: 0

Go/Leet Code 2022. 4. 15. 16:02

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

Implement strStr(). Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Clarification: What should we return when needle is an empty string? This is a great question to ask during an interview. For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strs..

Go/Leet Code 2022. 4. 4. 23:09

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

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