public void EvaluateTest(string fileName, long expectedResponse)
{
//Arrange
IEvaluateExpression _evaluateExpression = new EvaluateExpression();
decimal response = 0;
string[] readFileLinesResponse = File.ReadAllLines(string.Concat(Environment.CurrentDirectory, fileName));
//Act
TestDelegate code = (() => _evaluateExpression.Evaluate(ref readFileLinesResponse, ref response));
//Assert
Assert.IsNotNull(code);
}
public void Run()
{
ListNode intersection = new ListNode()
{
val = 4,
next = new ListNode()
{
val = 5,
next = new ListNode()
{
val = 6
}
}
};
ListNode root = new ListNode()
{
val = 1,
next = new ListNode()
{
val = 2,
next = new ListNode()
{
val = 3,
next = intersection
}
}
};
ListNode root2 = new ListNode()
{
val = 7,
next = new ListNode()
{
val = 8,
next = intersection
}
};
int[] query_type = new int[] { 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0 };
int[] key = new int[] { 5, 4, 1, 2, 2, 2, 3, 2, 5, 4, 4, 2, 4, 3, 5 };
int[] value = new int[] { 5, 3, 4, 4, 1, 4, 5, 1, 2, 3, 3, 3, 3, 1, 3 };
ListNode circular = new ListNode()
{
val = 16
};
circular.next = new ListNode()
{
val = 8,
next = new ListNode()
{
val = 4,
next = new ListNode()
{
val = 2,
next = circular
}
}
};
//ListNode circular = new ListNode() { val = 2 };
//circular.next = new ListNode()
//{
// val = 2,
// next = circular
//};
//AlternativeNodeSplit.alternativeSplit(BuildLL(new int[] { 1, 2, 3, 4, 5 }));
var solution
// = ReverseLL.reverse(root);
// = ZipLL.zip_given_linked_list(root);
// = LRUCache.implement_LRU_cache(3, query_type, key, value);
//= BalancedParenthesis.find_max_length_of_matching_parentheses("(((())(()");
// = MaxNumberInSlidingWindow.max_in_sliding_window(new int[] { 0 }, 1);
// = LLIntersection.find_intersection(root, root2);
// = FindMedian.find_median(circular.next);
// = SwapKthNode.swap_nodes(BuildLL(new int[] { 1, 2, 3, 4, 5, 6, 7 }), 3);
// = MinStack.min_stack(new int[] { 10, 5, 0, -1, 0, -1, 0 });
//= DutchSort.Sort(BuildLL(new int[] { 2, 3, 1, 5, 10, 1, 2 }), 2);
// = AddTwoNumbers.AddTwoNumbersMain(Utils.BuildList(new int[] { 7, 2, 4, 3 }), Utils.BuildList(new int[] { 5, 6, 4 }));
// = ValidExpression.HasMatchingParantheses("((1+2)*3*)");
// = ReverseInGroups.reverse_linked_list_in_groups_of_k(Utils.BuildList(new int[] { 1, 2, 3, 4, 5, 6, 7,8}), 3);
// = MergeSortLL.MergeSort(Utils.BuildList(new int[] { 5, 3, 1, 4, 2, 5, 6 }));
// = Partition.PartitionMain(Utils.BuildList(new int[] { 1, 4, 3, 2, 5, 2}), 3);
= EvaluateExpression.Evaluate("((2 + 3) * 2 / 10)");
}