mfocko/LeetCode
mfocko/LeetCode
1
0
Fork 0
Code Issues Pull requests Wiki Activity

chore(cs): format

Browse source 
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2024-03-15 17:22:58 +01:00
parent 09d5c6dc4e
commit 4763cdbdda
Signed by: mfocko
GPG key ID: 7C47D46246790496
4 changed files with 63 additions and 75 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
cs/arithmetic-slices-ii-subsequence.cs
View file

@ -17,7 +17,7 @@ public class Solution {
for (var i = 1; i < n; ++i) {
for (var j = 0; j < i; ++j) {
var diff = (long) nums[i] - nums[j];
var diff = (long)nums[i] - nums[j];
if (diff < int.MinValue || diff > int.MaxValue) {
continue;

132
cs/average-of-levels-in-binary-tree.cs
View file

@ -1,72 +1,60 @@
public class TreeNode
{
public int val;
public TreeNode? left;
public TreeNode? right;
public TreeNode(int val = 0, TreeNode? left = null, TreeNode? right = null)
{
this.val = val;
this.left = left;
this.right = right;
}
}
public class Solution
{
private class Level
{
long sum;
int counter;
public Level()
{
sum = 0;
counter = 0;
}
public void Add(int x)
{
sum += x;
counter++;
}
public double Average
{
get => sum / (double)counter;
}
}
private List<Level> AverageOfLevels(List<Level> averages, TreeNode? node, int level)
{
if (node == null)
{
return averages;
}
if (level == averages.Count)
{
averages.Add(new Level());
}
averages[level].Add(node.val);
AverageOfLevels(averages, node.left, level + 1);
AverageOfLevels(averages, node.right, level + 1);
return averages;
}
public IList<double> AverageOfLevels(TreeNode? root)
=> AverageOfLevels(new List<Level>(), root, 0).Select(level => level.Average).ToList();
public static void Main()
{
var s = new Solution();
foreach (var a in s.AverageOfLevels(new TreeNode(3, new TreeNode(9), new TreeNode(20, new TreeNode(15), new TreeNode(7)))))
{
Console.Write($"{a} ");
}
Console.WriteLine();
}
}
public class TreeNode {
public int val;
public TreeNode? left;
public TreeNode? right;
public TreeNode(int val = 0, TreeNode? left = null, TreeNode? right = null) {
this.val = val;
this.left = left;
this.right = right;
}
}
public class Solution {
private class Level {
long sum;
int counter;
public Level() {
sum = 0;
counter = 0;
}
public void Add(int x) {
sum += x;
counter++;
}
public double Average {
get => sum / (double)counter;
}
}
private List<Level> AverageOfLevels(List<Level> averages, TreeNode? node, int level) {
if (node == null) {
return averages;
}
if (level == averages.Count) {
averages.Add(new Level());
}
averages[level].Add(node.val);
AverageOfLevels(averages, node.left, level + 1);
AverageOfLevels(averages, node.right, level + 1);
return averages;
}
public IList<double> AverageOfLevels(TreeNode? root)
=> AverageOfLevels(new List<Level>(), root, 0).Select(level => level.Average).ToList();
public static void Main() {
var s = new Solution();
foreach (var a in s.AverageOfLevels(new TreeNode(3, new TreeNode(9), new TreeNode(20, new TreeNode(15), new TreeNode(7))))) {
Console.Write($"{a} ");
}
Console.WriteLine();
}
}

2
cs/n-th-tribonacci-number.cs
View file

@ -1,6 +1,6 @@
public class Solution {
public int Tribonacci(int n) {
var sequence = new int[]{0, 1, 1};
var sequence = new int[] { 0, 1, 1 };
if (n < 3) {
return sequence[n];

2
cs/poor-pigs.cs
View file

@ -1,5 +1,5 @@
public class Solution {
public int PoorPigs(int buckets, int minutesToDie, int minutesToTest) {
return (int) Math.Ceiling(Math.Log(buckets) / Math.Log(1 + minutesToTest / minutesToDie));
return (int)Math.Ceiling(Math.Log(buckets) / Math.Log(1 + minutesToTest / minutesToDie));
}
}