Gopythor

The nested loop Code Java class Solution { public int removeDuplicates(int[] nums) { // The initial length is simply the capacity. int length = nums.length; // Assume the last element is always unique. // Then for each element, delete it iff it is // the same as the one after it. Use our deletion // algorithm for deleting from any index. for (int i = length - 2; i >= 0; i--) { if (nums[i] == num..

Go/Leet Code 2022. 3. 6. 20:14

What are in-place array operations? Given an Array of integers, return an Array where every element at an even-indexed position is squared. Input: array = [9, -2, -9, 11, 56, -12, -3] Output: [81, -2, 81, 11, 3136, -12, 9] Explanation: The numbers at even indexes (0, 2, 4, 6) have been squared, whereas the numbers at odd indexes (1, 3, 5) have been left the same. Not in-place Code Java public in..

Go/Leet Code 2022. 3. 5. 18:52

Search in an Array Linear Search The time complexity for a linear search is O(N)O(N) Edge case refers to a problem that occurs when the value of data processed by the algorithm exceeds a certain range according to the characteristics of the algorithm. For example, a problem may occur when the value of the variable called fixnum exceeds the range of -128 to 127. https://kathak33.tistory.com/19 Le..

Go/Leet Code 2022. 3. 2. 19:19

Array Deletions Deleting From the End of an Array Code(Creates an Array with room for 10 elements, and then adds elements into the first 6 indexes of it.) Java // Declare an integer array of 10 elements. int[] intArray = new int[10]; // The array currently contains 0 elements int length = 0; // Add elements at the first 6 indexes of the Array. for(int i = 0; i < 6; i++) { intArray[length] = i; l..

Go/Leet Code 2022. 2. 26. 23:27