public void KthLargestTest()
{
int k = 3;
int[] nums = { 4, 5, 8, 2 };
KthLargest kthLargest = new KthLargest(k, nums);
}
public void RunProblem()
{
/*
* int k = 3;
* int[] arr = [4,5,8,2];
* KthLargest kthLargest = new KthLargest(3, arr);
* kthLargest.add(3); // returns 4
* kthLargest.add(5); // returns 5
* kthLargest.add(10); // returns 5
* kthLargest.add(9); // returns 8
* kthLargest.add(4); // returns 8
*/
int k = 3;
int[] arr = new int[] { 4, 5, 8, 2 };
KthLargest kthLargest = new KthLargest(k, arr);
int temp = 0;
temp = kthLargest.Add(3);
temp = kthLargest.Add(5);
temp = kthLargest.Add(10);
temp = kthLargest.Add(9);
temp = kthLargest.Add(4);
}
public void ExampleTest1()
{
KthLargest kthLargest = new KthLargest(3, new[] { 4, 5, 8, 2 });
int actual = kthLargest.Add(3);
int expected = 4;
Assert.Equal(expected, actual);
}
public void Test1()
{
var inputArray = new[] { 3, 2, 1, 4, 5, 6 };
var kthLargestNumber = 2;
var result = new KthLargest().FindKthLargest(inputArray, kthLargestNumber);
Assert.That(result, Is.EqualTo(5));
}
public void Test()
{
var obj = new KthLargest(2, new[] { 0 });
Assert.AreEqual(-1, obj.Add(-1));
Assert.AreEqual(0, obj.Add(1));
Assert.AreEqual(0, obj.Add(-2));
Assert.AreEqual(0, obj.Add(-4));
Assert.AreEqual(1, obj.Add(3));
}
// Start is called before the first frame update
void Start()
{
KthLargest obj = new KthLargest(3, new int[] { 4, 5, 8, 2 });
Debug.Log(obj.Add(3));
Debug.Log(obj.Add(5));
Debug.Log(obj.Add(10));
Debug.Log(obj.Add(9));
Debug.Log(obj.Add(4));
}
public void TestCase2()
{
var nums = new int[] { 0 };
var sln = new KthLargest(2, nums);
Assert.Equal(-1, sln.Add(-1));
Assert.Equal(0, sln.Add(1));
Assert.Equal(0, sln.Add(-2));
Assert.Equal(0, sln.Add(-4));
Assert.Equal(1, sln.Add(3));
}
public void TestCase1()
{
var nums = new int[] { 4, 5, 8, 2 };
var sln = new KthLargest(3, nums);
Assert.Equal(4, sln.Add(3));
Assert.Equal(5, sln.Add(5));
Assert.Equal(5, sln.Add(10));
Assert.Equal(8, sln.Add(9));
Assert.Equal(8, sln.Add(4));
}
static void Main(string[] args)
{
var kthLargest = new KthLargest(3, new int[] { 4, 5, 8, 2 });
Console.WriteLine(kthLargest.Add(3));
Console.WriteLine(kthLargest.Add(5));
Console.WriteLine(kthLargest.Add(10));
Console.WriteLine(kthLargest.Add(9));
Console.WriteLine(kthLargest.Add(4));
Console.ReadKey();
}
public void AddTest()
{
int k = 3;
int[] arr = { 4, 5, 8, 2 };
KthLargest kthLargest = new KthLargest(k, arr);
Assert.IsTrue(kthLargest.Add(3) == 4); // returns 4
Assert.IsTrue(kthLargest.Add(5) == 5); // returns 5
Assert.IsTrue(kthLargest.Add(10) == 5); // returns 5
Assert.IsTrue(kthLargest.Add(9) == 8); // returns 8
Assert.IsTrue(kthLargest.Add(4) == 8); // returns 8
}
public static void EntryPoint()
{
//KthLargest obj = new KthLargest(3, new int[] { 4, 5, 8, 2 });
//obj.Add(3);
//obj.Add(5);
KthLargest obj = new KthLargest(2, new int[] { 0 });
obj.Add(-1);
obj.Add(1);
obj.Add(-2);
}
public void ExampleTest5()
{
KthLargest kthLargest = new KthLargest(3, new[] { 4, 5, 8, 2 });
kthLargest.Add(3);
kthLargest.Add(5);
kthLargest.Add(10);
kthLargest.Add(9);
int actual = kthLargest.Add(4);
int expected = 8;
Assert.Equal(expected, actual);
}
static void HeapsMain(string[] args)
{
try
{
#region MaxHeap
Console.ForegroundColor = ConsoleColor.DarkYellow;
Console.WriteLine("Implementing the MaxHeap with basic Operations");
Console.ForegroundColor = ConsoleColor.White;
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Pushing the elements 10, 5, 17, 25, 4, 22 to Heap");
Console.ForegroundColor = ConsoleColor.White;
MaxHeap customHeaps = new MaxHeap(6);
customHeaps.Insert(10);
customHeaps.Insert(5);
customHeaps.Insert(17);
customHeaps.Insert(25);
customHeaps.Insert(4);
customHeaps.Insert(22);
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Printing the elements from the heap");
Console.ForegroundColor = ConsoleColor.White;
customHeaps.Print();
Console.WriteLine();
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("In heap we can delete only a root node. So we are deleting root node now");
Console.ForegroundColor = ConsoleColor.White;
int result = customHeaps.Remove();
Console.WriteLine("Deleted root node is {0}", result);
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Printing the elements from the heap");
Console.ForegroundColor = ConsoleColor.White;
customHeaps.Print();
Console.WriteLine();
customHeaps.Insert(25);
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Creating new heap with 5, 3, 10, 1, 4, 2 for sorting");
Console.ForegroundColor = ConsoleColor.White;
int[] numbers = { 8, 3, 10, 1, 4, 2, 7 };
MaxHeap descending = new MaxHeap(numbers.Length);
foreach (var number in numbers)
{
descending.Insert(number);
}
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Descending order of the Heaps");
Console.ForegroundColor = ConsoleColor.White;
for (int i = 0; i < numbers.Length; i++)
{
numbers[i] = descending.Remove();
}
foreach (var number in numbers)
{
Console.Write(number + " ");
}
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Ascending order of the Heaps");
Console.ForegroundColor = ConsoleColor.White;
int[] items = { 8, 5, 3, 10, 1, 4, 2, 7 };
MaxHeap ascending = new MaxHeap(items.Length);
foreach (var item in items)
{
ascending.Insert(item);
}
for (int i = items.Length - 1; i >= 0; i--)
{
items[i] = ascending.Remove();
}
foreach (var item in items)
{
Console.Write(item + " ");
}
Console.WriteLine();
#endregion
#region PriorityQueueWithHeap
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Implemeting Priority Queues with Heaps");
Console.WriteLine("Creating a Priority Queue wit 10, 5, 17, 25, 4, 22 using Heap");
Console.ForegroundColor = ConsoleColor.White;
PriorityQueueWithHeap priorityQueueWithHeap = new PriorityQueueWithHeap(7);
priorityQueueWithHeap.Enqueue(10);
priorityQueueWithHeap.Enqueue(5);
priorityQueueWithHeap.Enqueue(7);
priorityQueueWithHeap.Enqueue(17);
priorityQueueWithHeap.Enqueue(25);
priorityQueueWithHeap.Enqueue(4);
priorityQueueWithHeap.Enqueue(22);
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Printing the elements of Priority Queue");
Console.ForegroundColor = ConsoleColor.White;
priorityQueueWithHeap.customHeaps.Print();
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Removing 2 items from the Priority Queue");
Console.ForegroundColor = ConsoleColor.White;
Console.WriteLine("Removed items {0} {1}", priorityQueueWithHeap.Dequeue(), priorityQueueWithHeap.Dequeue());
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Printing the elements of Priority Queue");
Console.ForegroundColor = ConsoleColor.White;
priorityQueueWithHeap.customHeaps.Print();
Console.WriteLine();
#endregion
#region HeapifyDemo
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Implementing Heapify method - means Transforming an array to heap inplace");
Console.WriteLine("Input array is 5, 3, 8, 4, 1, 2");
Console.ForegroundColor = ConsoleColor.White;
int[] input = { 5, 3, 8, 4, 1, 2, 10 };
HeapifyDemo.Heapify(input);
foreach (var item in input)
{
Console.Write(item + " ");
}
Console.WriteLine();
#endregion
#region KthLargest
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Finding 2nd largest element in the array");
Console.WriteLine("Input array is 5, 3, 8, 4, 1, 2, 10");
Console.ForegroundColor = ConsoleColor.White;
KthLargest kthLargest = new KthLargest(7);
input = new int[] { 5, 3, 8, 4, 1, 2, 10 };
int largest = kthLargest.getKthLargest(input, 2);
Console.WriteLine("2nd largest in array is {0}", largest);
#endregion
#region HeapCheck
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Check whether the given heap is max heap or min heap");
Console.WriteLine("Input array is 5, 3, 8, 4, 1, 2, 10");
Console.ForegroundColor = ConsoleColor.White;
HeapCheck maxHeapCheck = new HeapCheck();
input = new int[] { 8, 4, 5, 3, 1, 2, 0 };
Console.WriteLine("Given array represents Max Heap: {0}", HeapCheck.isMaxHeap(input));
input = new int[] { 0, 2, 1, 3, 5, 4, 8 };
Console.WriteLine("Given array represents Max Heap: {0}", HeapCheck.isMinHeap(input));
#endregion
#region MinHeap
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.DarkYellow;
Console.WriteLine("Implementing the MinHeap with basic Operations");
Console.ForegroundColor = ConsoleColor.White;
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Pushing the elements 10, 5, 17, 25, 4, 22 to Heap");
Console.ForegroundColor = ConsoleColor.White;
MinHeap minHeap = new MinHeap(6);
minHeap.Insert(10);
minHeap.Insert(5);
minHeap.Insert(17);
minHeap.Insert(25);
minHeap.Insert(4);
minHeap.Insert(22);
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Printing the elements from the heap");
Console.ForegroundColor = ConsoleColor.White;
minHeap.Print();
Console.WriteLine();
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("In heap we can delete only a root node. So we are deleting root node now");
Console.ForegroundColor = ConsoleColor.White;
result = minHeap.Remove();
Console.WriteLine("Deleted root node is {0}", result);
Console.WriteLine();
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("Printing the elements from the heap");
Console.ForegroundColor = ConsoleColor.White;
minHeap.Print();
Console.WriteLine();
minHeap.Insert(25);
#endregion
}
catch (Exception ex)
{
Console.ForegroundColor = ConsoleColor.DarkRed;
Console.WriteLine(ex.Message);
Console.ForegroundColor = ConsoleColor.White;
}
}
