| | | 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.LongestBinarySubsequenceLessThanOrEqualToK; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class LongestBinarySubsequenceLessThanOrEqualToKGreedy : ILongestBinarySubsequenceLessThanOrEqualToK |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="s"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int LongestSubsequence(string s, int k) |
| | 2 | 25 | | { |
| | 2 | 26 | | var count = 0; |
| | 2 | 27 | | var value = 0; |
| | 2 | 28 | | var power = 1; |
| | | 29 | | |
| | 8 | 30 | | for (var i = s.Length - 1; i >= 0; i--) |
| | 4 | 31 | | { |
| | 4 | 32 | | if (s[i] == '1' && value + power <= k) |
| | 2 | 33 | | { |
| | 2 | 34 | | value += power; |
| | | 35 | | |
| | 2 | 36 | | count++; |
| | 2 | 37 | | } |
| | | 38 | | |
| | 4 | 39 | | if (power > k / 2) |
| | 2 | 40 | | { |
| | 2 | 41 | | break; |
| | | 42 | | } |
| | | 43 | | |
| | 2 | 44 | | power <<= 1; |
| | 2 | 45 | | } |
| | | 46 | | |
| | 17 | 47 | | return count + s.Count(c => c == '0'); |
| | 2 | 48 | | } |
| | | 49 | | } |