< Summary

Information
Class: LeetCode.Algorithms.MinimumCommonValue.MinimumCommonValueTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumCommonValue\MinimumCommonValueTwoPointers.cs
Line coverage
100%
Covered lines: 18
Uncovered lines: 0
Coverable lines: 18
Total lines: 48
Line coverage: 100%
Branch coverage
100%
Covered branches: 8
Total branches: 8
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
GetCommon(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumCommonValue\MinimumCommonValueTwoPointers.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.MinimumCommonValue;
 13
 14/// <inheritdoc />
 15public class MinimumCommonValueTwoPointers : IMinimumCommonValue
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n + m), where n is the length of nums2 and m is the length of nums1
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums1"></param>
 22    /// <param name="nums2"></param>
 23    /// <returns></returns>
 24    public int GetCommon(int[] nums1, int[] nums2)
 1225    {
 1226        var nums1Pointer = 0;
 1227        var nums2Pointer = 0;
 28
 2729        while (nums1Pointer < nums1.Length && nums2Pointer < nums2.Length)
 2230        {
 2231            if (nums1[nums1Pointer] == nums2[nums2Pointer])
 732            {
 733                return nums1[nums1Pointer];
 34            }
 35
 1536            if (nums1[nums1Pointer] < nums2[nums2Pointer])
 1137            {
 1138                nums1Pointer++;
 1139            }
 40            else
 441            {
 442                nums2Pointer++;
 443            }
 1544        }
 45
 546        return -1;
 1247    }
 48}