nullptr/Leetcode
Template
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

New tasks

Browse Source
This commit is contained in:
nullptroma
2023-03-05 00:46:41 +03:00
parent 1288b304ae
commit b285770a9c
15 changed files with 1018 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
4. Median of Two Sorted Arrays/4. Median of Two Sorted Arrays.csproj Normal file
View File

@@ -0,0 +1,11 @@
<Project Sdk="Microsoft.NET.Sdk">
<PropertyGroup>
<OutputType>Exe</OutputType>
<TargetFramework>net7.0</TargetFramework>
<RootNamespace>_4._Median_of_Two_Sorted_Arrays</RootNamespace>
<ImplicitUsings>enable</ImplicitUsings>
<Nullable>enable</Nullable>
</PropertyGroup>
</Project>

9
4. Median of Two Sorted Arrays/Program.cs Normal file
View File

@@ -0,0 +1,9 @@
namespace _4._Median_of_Two_Sorted_Arrays;
internal class Program
{
static void Main(string[] args)
{
Console.WriteLine(new Solution().FindMedianSortedArrays(new []{1,2}, new []{3,4}));
}
}

32
4. Median of Two Sorted Arrays/Solution.cs Normal file
View File

@@ -0,0 +1,32 @@
namespace _4._Median_of_Two_Sorted_Arrays;
public class Solution
{
private int _left = 0;
private int _right = 0;
public double FindMedianSortedArrays(int[] nums1, int[] nums2)
{
int i1 = 0;
int i2 = 0;
int size = nums1.Length + nums2.Length;
while (i1 + i2 < size / 2+1 && (i1 < nums1.Length || i2 < nums2.Length))
{
if(i1 < nums1.Length && i2 >= nums2.Length)
Push(nums1[i1++]);
else if(i1 >= nums1.Length && i2 < nums2.Length)
Push(nums2[i2++]);
else if (nums1[i1] < nums2[i2])
Push(nums1[i1++]);
else
Push(nums2[i2++]);
}
return size%2==1?_right : (_left+_right)/2.0;
}
private void Push(int num)
{
_left = _right;
_right = num;
}
}