< Summary

Information

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

Line coverage

53%

Branch coverage

38%

Method coverage

Feature is only available for sponsors

Metrics

Method	Branch coverage	Crap Score	Cyclomatic complexity	Line coverage
SmallestNumber(...)	38.88%	51	18	53.33%

#	Line	Line coverage
	`1`	`// --------------------------------------------------------------------------------`
	`2`	`// Copyright (C) 2026 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.SmallestNumberWithAllSetBits;`
	`13`
	`14`	`/// <inheritdoc />`
	`15`	`public sealed class SmallestNumberWithAllSetBitsSwitch : ISmallestNumberWithAllSetBits`
	`16`	`{`
	`17`	`/// <summary>`
	`18`	`/// Time complexity - O(1)`
	`19`	`/// Space complexity - O(1)`
	`20`	`/// </summary>`
	`21`	`/// <param name="n"></param>`
	`22`	`/// <returns></returns>`
	`23`	`public int SmallestNumber(int n)`
3	`24`	`{`
3	`25`	`return n switch`
3	`26`	`{`
0	`27`	`1 => 1,`
1	`28`	`<= 3 => 3,`
1	`29`	`<= 7 => 7,`
1	`30`	`<= 15 => 15,`
0	`31`	`<= 31 => 31,`
0	`32`	`<= 63 => 63,`
0	`33`	`<= 127 => 127,`
0	`34`	`<= 255 => 255,`
0	`35`	`<= 511 => 511,`
0	`36`	`_ => 1023`
3	`37`	`};`
3	`38`	`}`
	`39`	`}`