Gopythor

Code Java // "static void main" must be defined in a public class. public class Main { private static void printArray(int[][] a) { for (int i = 0; i < a.length; ++i) { System.out.println(a[i]); } for (int i = 0; i < a.length; ++i) { for (int j = 0; a[i] != null && j < a[i].length; ++j) { System.out.print(a[i][j] + " "); } System.out.println(); } } public static void main(String[] args) { System...

Go/Leet Code 2022. 3. 27. 04:37

통상적으로 변수 등이 String으로 사용된다면 큰 차이는 없음. 그러나 String이 아닌 형태가 서로 결합한다면 문제가 발생함. Code func main() { sstring := fmt.Sprint("Hello ", "World") nstring := "Hello World" fmt.Println(sstring) fmt.Println(nstring) }https://go.dev/play/p/WO415NpCkSl 문제는 String이 아닌 Integer 등이 혼합될 때이다. Code func main() { Sequence := 254 sstring := fmt.Sprintf("Sequence number %d is on hold", Sequence) fmt.Println(sstring) nstri..

Go/Study record 2022. 3. 26. 20:21

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 Array https://leetcode.com/explore/learn/card/array-and-string/201/introduction-to-array/1143/ Java // "static void main" must be defined in a public class. public class Main { public static void main(String[] args) { // 1. Initialize int[] a0 = new int[5]; int[] a1 = {1, 2, 3}; // 2. Get Length System.out.println("The size of a1 is: " + a1.length); // 3. Access Element System.out...

Go/Leet Code 2022. 3. 22. 16:47

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

A school is trying to take an annual photo of all the students. The students are asked to stand in a single file line in non-decreasing order by height. Let this ordering be represented by the integer array expected where expected[i] is the expected height of the ith student in line. You are given an integer array heights representing the current order that the students are standing in. Each hei..

Go/Leet Code 2022. 3. 17. 22:04

QuickSort Divide and conquer algorithm After determining the pivot, the position of the pivot is confirmed and aligned Quicksort has many variations based on pivot. When comparing numbers, the pivot is the standard. The speed varies depending on the position of the pivot. There are left pivot, right pivot, middle pivot, and random pivot. O(n²) in the worst case Range, Criteria, Compare, Swap qui..

Go/Study record 2022. 3. 17. 18:44