| | 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.FindAllNumbersDisappearedInArray; |
| | 13 | |
|
| | 14 | | /// <inheritdoc /> |
| | 15 | | public class FindAllNumbersDisappearedInArraySignFlipping : IFindAllNumbersDisappearedInArray |
| | 16 | | { |
| | 17 | | /// <summary> |
| | 18 | | /// Time complexity - O(n) |
| | 19 | | /// Space complexity - O(1) |
| | 20 | | /// </summary> |
| | 21 | | /// <param name="nums"></param> |
| | 22 | | /// <returns></returns> |
| | 23 | | public IList<int> FindDisappearedNumbers(int[] nums) |
| 2 | 24 | | { |
| 24 | 25 | | for (var i = 0; i < nums.Length; i++) |
| 10 | 26 | | { |
| 10 | 27 | | var index = Math.Abs(nums[i]) - 1; |
| | 28 | |
|
| 10 | 29 | | if (nums[index] > 0) |
| 7 | 30 | | { |
| 7 | 31 | | nums[index] = -nums[index]; |
| 7 | 32 | | } |
| 10 | 33 | | } |
| | 34 | |
|
| 2 | 35 | | var result = new List<int>(); |
| | 36 | |
|
| 24 | 37 | | for (var i = 0; i < nums.Length; i++) |
| 10 | 38 | | { |
| 10 | 39 | | if (nums[i] > 0) |
| 3 | 40 | | { |
| 3 | 41 | | result.Add(i + 1); |
| 3 | 42 | | } |
| 10 | 43 | | } |
| | 44 | |
|
| 2 | 45 | | return result; |
| 2 | 46 | | } |
| | 47 | | } |