< Summary

Information
Class: LeetCode.Algorithms.DecodeXORedArray.DecodeXORedArrayIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\DecodeXORedArray\DecodeXORedArrayIterative.cs
Line coverage
100%
Covered lines: 9
Uncovered lines: 0
Coverable lines: 9
Total lines: 37
Line coverage: 100%
Branch coverage
100%
Covered branches: 2
Total branches: 2
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
Decode(...)100%22100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\DecodeXORedArray\DecodeXORedArrayIterative.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.DecodeXORedArray;
 13
 14/// <inheritdoc />
 15public class DecodeXORedArrayIterative : IDecodeXORedArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="encoded"></param>
 22    /// <param name="first"></param>
 23    /// <returns></returns>
 24    public int[] Decode(int[] encoded, int first)
 225    {
 226        var result = new int[encoded.Length + 1];
 27
 228        result[0] = first;
 29
 1830        for (var i = 0; i < encoded.Length; i++)
 731        {
 732            result[i + 1] = result[i] ^ encoded[i];
 733        }
 34
 235        return result;
 236    }
 37}