public class Solution {
public int[] Shuffle(int[] nums, int n) {
var list = new List<int>();
for (var i = 0; i < n; ++i) {
list.Add(nums[i]);
list.Add(nums[n + i]);
}
return list.ToArray();
}
}
Source: https://leetcode.com/problems/shuffle-the-array/
"Simplicity can't be bought later, it must be earned from the start" -- DB
Sunday, February 14, 2021
Leetcode everyday: 1470. Shuffle the Array. Easy
Leetcode Everyday: 1431. Kids With Greatest Number of Candies. Easy
public class Solution {
public IList KidsWithCandies(int[] candies, int extraCandies) {
var maxCandy = candies.Max();
return candies.Select(candy => candy + extraCandies >= maxCandy).ToList();
}
}
Source:
https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/
Leetcode Everyday: 1672. Richest Customer Wealth. Easy
public class Solution {
public int MaximumWealth(int[][] accounts) {
return accounts.Select(a => a.Sum()).Max();
}
}
Source:
https://leetcode.com/problems/richest-customer-wealth/
Leetcode Everyday: 1108. Defanging an IP Address. Easy
public class Solution {
public string DefangIPaddr(string address) {
return address.Replace(".", "[.]");
}
}
Source:
https://leetcode.com/problems/defanging-an-ip-address/
Leetcode Everyday: 1480. Running Sum of 1d Array. Easy
public class Solution {
public int[] RunningSum(int[] nums) {
var accum = 0;
var list = new List<int>();
foreach (var n in nums) {
accum += n;
list.Add(accum);
}
return list.ToArray();
}
}
Source:
https://leetcode.com/problems/running-sum-of-1d-array/
Subscribe to:
Posts (Atom)