초보코딩연습

Problem You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to know how many of the stones you have are also jewels. Letters are case sensitive, so "a" is considered a different type of stone from "A". Example 1: Input: jewels = "aA", stones = "aAAbbbb" Output: 3 ..

Problem There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith kid has, and an integer extraCandies, denoting the number of extra candies that you have. Return a boolean array result of length n, where result[i] is true if, after giving the ith kid all the extraCandies, they will have the greatest number of candies am..

Problem Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nums = [1,2,3,4] Output: [1,3,6,10] Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4]. Example 2: Input: nums = [1,1,1,1,1] Output: [1,2,3,4,5] Explanation: Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, ..

Problem Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 List[int]: ans = [] for i in range(len(nums)): ans.append(nums[nums[i]]) return ans 내 생애 처음 풀어 본 리드코드 문제 결국은 해결책을 보고 이해를 했다. ans = []는 배열을 지정했다. for in range는 반복문이고, len(nums)는 어떻게 반복 할 것인가에 대한 조건이다. len은 길이다. Example 1에 보면 숫자가 6개가 있다. 그렇다 이 for in range는 6번 반복 될..