< Summary

Information

Class:	LeetCode.Algorithms.FibonacciNumber.FibonacciNumberIterative
Assembly:	LeetCode
File(s):	D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FibonacciNumber\FibonacciNumberIterative.cs

Line coverage

100%

Branch coverage

100%

Method coverage

Feature is only available for sponsors

Metrics

Method	Branch coverage	Crap Score	Cyclomatic complexity	Line coverage
Fib(...)	100%	4	4	100%

#	Line	Line 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`
	`12`	`namespace LeetCode.Algorithms.FibonacciNumber;`
	`13`
	`14`	`/// <inheritdoc />`
	`15`	`public class FibonacciNumberIterative : IFibonacciNumber`
	`16`	`{`
	`17`	`/// <summary>`
	`18`	`/// Time complexity - O(n)`
	`19`	`/// Space complexity - O(1)`
	`20`	`/// </summary>`
	`21`	`/// <param name="n"></param>`
	`22`	`/// <returns></returns>`
	`23`	`public int Fib(int n)`
5	`24`	`{`
5	`25`	`if (n <= 1)`
2	`26`	`{`
2	`27`	`return n;`
	`28`	`}`
	`29`
3	`30`	`var a = 0;`
3	`31`	`var b = 1;`
	`32`
18	`33`	`for (var i = 2; i <= n; i++)`
6	`34`	`{`
6	`35`	`var c = a + b;`
6	`36`	`a = b;`
6	`37`	`b = c;`
6	`38`	`}`
	`39`
3	`40`	`return b;`
5	`41`	`}`
	`42`	`}`