Gopythor

Given a string s, reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order. Example 1: Input: s = "Let's take LeetCode contest" Output: "s'teL ekat edoCteeL tsetnoc" Example 2: Input: s = "God Ding" Output: "doG gniD" Constraints: 1

Go/Leet Code 2022. 4. 16. 20:22

Given an input string s, reverse the order of the words. A word is defined as a sequence of non-space characters. The words in s will be separated by at least one space. Return a string of the words in reverse order concatenated by a single space. Note that s may contain leading or trailing spaces or multiple spaces between two words. The returned string should only have a single space separatin..

Go/Leet Code 2022. 4. 16. 18:05

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

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

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

Given two binary strings a and b, return their sum as a binary string. Example 1: Input: a = "11", b = "1" Output: "100" Example 2: Input: a = "1010", b = "1011" Output: "10101" Constraints: 1 = 0 { switch { case carry == 1: if aa[alen] == "0" && bb[blen] == "0" { ans = append([]string{"1"}, ans...) carry = 0 alen-- blen-- } else if aa[alen] == "1" && bb[blen] == "0" || aa[alen] == "0" && bb[ble..

Go/Leet Code 2022. 4. 3. 20:15