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

Day3. Start Algorithm

Browse Source
This commit is contained in:
Electrominch
2022-10-05 00:44:15 +03:00
parent c9916dabad
commit 062e03bdbf
32 changed files with 446 additions and 57 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
88. Merge Sorted Array/Program.cs
View File

@@ -4,8 +4,8 @@
{
static void Main(string[] args)
{
int[] n1 = new int[] { 1, 2, 3, 0, 0, 0 };
int[] n2 = new int[] { 2,5,6 };
int[] n1 = new int[] { 1, 2, 3, 0, 0, 0 };
int[] n2 = new int[] { 2, 5, 6 };
Solution solution = new Solution();
solution.Merge(n1, 3, n2, n2.Length);
Console.WriteLine(String.Join(" ", n1));

14
88. Merge Sorted Array/Solution.cs
View File

@@ -1,15 +1,11 @@
using System;
using System.Collections.Generic;
using System.Linq;
namespace _88._Merge_Sorted_Array;
namespace _88._Merge_Sorted_Array;
public class Solution
{
public void Merge(int[] nums1, int m, int[] a2, int n)
{
int[] a1 = new int[m];
for(int i = 0; i < m; i++)
for (int i = 0; i < m; i++)
a1[i] = nums1[i];
int resIndex = 0;
int a1Index = 0, a2Index = 0;
@@ -20,18 +16,18 @@ public class Solution
int toWrite = 0;
if (n1 != null && n2 != null)
{
toWrite = Math.Min(n1.Value,n2.Value);
toWrite = Math.Min(n1.Value, n2.Value);
if (n1 < n2)
a1Index++;
else
a2Index++;
}
else if(n1!=null)
else if (n1 != null)
{
toWrite = n1.Value;
a1Index++;
}
else if(n2!=null)
else if (n2 != null)
{
toWrite = n2.Value;
a2Index++;