2使用XOR对Givin字符串的称赞

给定一个二进制字符串，任务是借助XOR运算符将该字符串转换为二进制补码。

例子：

Input : 00000101
Output :11111011

Input : 10010
Output : 01110

我们已经在上一篇文章中讨论了一种寻找2的补码的方法

对于2的补码，我们首先找到一个人的补码。我们从LSB(最低有效位)开始遍历一个补数，并查找0。我们翻转所有1(更改为0)，直到找到0。最后，翻转找到的0。

我们从最后一个漫游器开始遍历，并一直忽略所有0，直到找到1。我们也忽略了第一个1。然后，通过对1进行XOR来切换所有位。

C++

// C++ program to find 2's complement using XOR.
#include 
using namespace std;
 
string TwoscomplementbyXOR(string str)
{
    int n = str.length();
 
    // A flag used to find if a 1 bit is seen
    // or not.
    bool check_bit = 0;
 
    for (int i = n - 1; i >= 0; i--) {
        if (str[i] == '0' && check_bit == 0) {
            continue;
        }
        else {
 
            // xor operator is used to flip the 
            if (check_bit == 1)
                str[i] = (str[i] - '0') ^ 1 + '0';
 
            // bits after converting in to
            // ASCII values
            check_bit = 1;
        }
    }
 
    // if there is no 1 in the string so just add
    // 1 in starting of string and return
    if (check_bit == 0)
        return "1" + str;
    else
        return str;
}
 
// Driver code
int main()
{
    string str = "101";
    cout << TwoscomplementbyXOR(str);
    return 0;
}

Java

// Java program to find 2's complement using XOR.
import java.util.*;
 
class GFG{
 
static void TwoscomplementbyXOR(String str)
{
    int n = str.length();
     
    // A flag used to find if a 1 bit is seen
    // or not.
    boolean check_bit = false;
 
    for(int i = n - 1; i >= 0; i--)
    {
        if (str.charAt(i) == '0' &&
            check_bit == false)
        {
            continue;
        }
        else
        {
             
            // xor operator is used to flip the 
            if (check_bit == true)
            {
                if (str.charAt(i) == '0')
                    str = str.substring(0, i) + '1' +
                          str.substring(i + 1);
                else
                     str = str.substring(0, i) + '0' +
                           str.substring(i + 1);
            }
             
            // bits after converting in to
            // ASCII values
            check_bit = true;
        }
    }
     
    // If there is no 1 in the string so just add
    // 1 in starting of string and return
    if (check_bit == false)
    {
        System.out.println("1" + str);
    }
    else
        System.out.println(str);
}
 
// Driver code
public static void main(String[] args)
{
    String str = "101";
     
    TwoscomplementbyXOR(str);
}
}
 
// This code is contributed by amreshkumar3

Python3

# Python program to find 2's complement using XOR.
def TwoscomplementbyXOR(str):
    n = len(str)
 
    # A flag used to find if a 1 bit is seen
    # or not.
    check_bit = 0
    i = n - 1
    s = list(str)
    while (i >= 0):
        if (s[i] == '0' and check_bit == 0):
            continue
        else:
 
            # xor operator is used to flip the
            if (check_bit == 1):
                s[i] = chr((ord(s[i]) - 48) ^ 1 + 48)
 
            # bits after converting in to
            # ASCII values
            check_bit = 1
        i -= 1
 
    # if there is no 1 in the string so just add
    # 1 in starting of string and return
    str = "".join(s)
    if (check_bit == 0):
        return "1" + str
    else:
        return str
 
# Driver code
str = "101"
print(TwoscomplementbyXOR(str))
 
# This code is contributed by subhammahato348.

C#

// C# program to find 2's complement using XOR.
using System;
class GFG {
 
  static void TwoscomplementbyXOR(string str)
  {
    int n = str.Length;
 
    // A flag used to find if a 1 bit is seen
    // or not.
    bool check_bit = false;
    for(int i = n - 1; i >= 0; i--)
    {
      if (str[i] == '0' &&
          check_bit == false)
      {
        continue;
      }
      else
      {
 
        // xor operator is used to flip the 
        if (check_bit == true)
        {
          if (str[i] == '0')
            str = str.Substring(0, i) + '1' +
            str.Substring(i + 1);
          else
            str = str.Substring(0, i) + '0' +
            str.Substring(i + 1);
        }
 
        // bits after converting in to
        // ASCII values
        check_bit = true;
      }
    }
 
    // If there is no 1 in the string so just add
    // 1 in starting of string and return
    if (check_bit == false)
    {
      Console.WriteLine("1" + str);
    }
    else
      Console.WriteLine(str);
  }
 
  // Driver code
  static void Main() {
    string str = "101";
 
    TwoscomplementbyXOR(str);
  }
}
 
// This code is contributed by divyeshrabadiya07.

PHP

= 0; $i--)
    {
        if ($str[$i] == '0' &&
            $check_bit == 0)
        {
            continue;
        }
        else
        {
 
            // xor operator is used
            // to flip the
            if ($check_bit == 1)
                $str[$i] = ($str[$i] - '0') ^ 1 + '0';
 
            // bits after converting in to
            // ASCII values
            $check_bit = 1;
        }
    }
 
    // if there is no 1 in the string
    // so just add 1 in starting of
    // string and return
    if ($check_bit == 0)
        return "1" + $str;
    else
        return $str;
}
 
// Driver code
$str = "101";
echo TwoscomplementbyXOR($str);
     
// This code is contributed by akt_mit
?>

输出：

011