Kotlin33 78] 1672. Richest Customer Wealth Kotlin https://leetcode.com/problems/richest-customer-wealth/description/ Richest Customer Wealth - LeetCode Can you solve this real interview question? Richest Customer Wealth - You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the i th customer has in the j th bank. Return the wealth that the richest customer has. A custom leetcode.com 2차원 int 배열이 주어질때 각 행의 합 중 .. 2023. 4. 19. 74] Leetcode 2574. Left and Right Sum Differences Kotlin https://leetcode.com/problems/left-and-right-sum-differences/description/ Left and Right Sum Differences - LeetCode Can you solve this real interview question? Left and Right Sum Differences - Given a 0-indexed integer array nums, find a 0-indexed integer array answer where: * answer.length == nums.length. * answer[i] = |leftSum[i] - rightSum[i]|. Where: * leftSum[i] is leetcode.com 배열이 주어지고 왼쪽에.. 2023. 4. 6. 73] Leetcode 2011. Final Value of Variable After Performing OperationsEasy1.1K151 #Kotlin https://leetcode.com/problems/final-value-of-variable-after-performing-operations/description/ Final Value of Variable After Performing Operations - LeetCode Can you solve this real interview question? Final Value of Variable After Performing Operations - There is a programming language with only four operations and one variable X: * ++X and X++ increments the value of the variable X by 1. * --X.. 2023. 4. 5. 70] Leetcode 1929. Concatenation of Array int 배열을 두번 써주면 된다. class Solution { fun getConcatenation(nums: IntArray): IntArray { val ans = IntArray(nums.size *2 ) for (i in nums.indices) { ans[i] = nums[i]; ans[i+ nums.size] = nums[i]; } return ans; } } . class Solution { fun getConcatenation(nums: IntArray): IntArray { val size = nums.size val concatenationArray = IntArray(size * 2) for (i in nums.indices) { concatenationArray[i] = nums[.. 2023. 4. 3. 이전 1 2 3 4 5 6 7 ··· 9 다음
