< Summary

Information
Class: LeetCode.Algorithms.CheckIfItIsStraightLine.CheckIfItIsStraightLineIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CheckIfItIsStraightLine\CheckIfItIsStraightLineIterative.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 44
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
CheckStraightLine(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CheckIfItIsStraightLine\CheckIfItIsStraightLineIterative.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.CheckIfItIsStraightLine;
 13
 14/// <inheritdoc />
 15public class CheckIfItIsStraightLineIterative : ICheckIfItIsStraightLine
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="coordinates"></param>
 22    /// <returns></returns>
 23    public bool CheckStraightLine(int[][] coordinates)
 324    {
 325        var a = coordinates[0];
 326        var b = coordinates[^1];
 27
 328        var dx = b[0] - a[0];
 329        var dy = b[1] - a[1];
 30
 1631        for (var i = 1; i < coordinates.Length - 1; i++)
 732        {
 733            var x = coordinates[i][0] - a[0];
 734            var y = coordinates[i][1] - a[1];
 35
 736            if (dx * y != dy * x)
 237            {
 238                return false;
 39            }
 540        }
 41
 142        return true;
 343    }
 44}