Gopythor

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

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

21시에 면접 테스트를 했는데 기존에 준비하지 않아 상당히 어버버 하다 끝났다. 영어 면접을 기반으로 준비하는 것도 나쁘지 않겠지만, 일본 회사를 준비하려면 그래도 최소한 일본어로 대화를 할줄 알면 플러스 요인이 되지 않을까 하고 준비 중이다. 예상 질문은 아래와 같았다. プログラミング の仕事を経験した事がありますか？ 프로그래밍을 경험해본 적이 있습니까? 私達の会社はどのような会社だとおもいますか？ 우리 회사를 어떤 회사라고 생각하고 있습니까? どうしてうちを選びましたか？ 어째서 우리를 선택했습니까? ほかにもいい仕事があったのはないんですか？ 그 밖에도 좋은 일이 있지 않았습니까? 간단했지만, 일본어로 생각하다 보니 문장이 제대로 만들어지지 않았다. 1) 지원 분야 적성 - 프로그래밍 직장 경험을 이야기해도 좋지만..

일본어/면접 2022. 3. 30. 16:41

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