我需要将一个整数 a
和一个整数数组 q
(最大长度为 100,000) 进行异或操作。例如,如果我循环进行操作:
a XOR q[0]
a XOR q[1]
.....
a XOR q[100000]
(重复执行 100,000 次)
然后我就会得到一系列被异或过的 a
。
我正在编写一个控制台应用程序,它将传递所需的输入。
我使用内置的 C# ^
运算符执行异或操作。还有其他方法吗?
将整数转换为字节数组,然后对每个位执行异或操作并计算出最终结果是否是一个好主意?
输入(请勿保留两行之间的空格)
1
15 8
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
10 6 10
1023 7 7
33 5 8
182 5 10
181 1 13
5 10 15
99 8 9
33 10 14
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace XOR
{
class Solution
{
static void Main(string[] args)
{
List<TestCase> testCases = ReadLine();
//Console.WriteLine(DateTime.Now.ToLongTimeString());
CalculationManager calculationManager = new CalculationManager();
foreach (var testCase in testCases)
{
var ints = testCase.Queries.AsParallel().Select(query => calculationManager.Calculate(query, testCase.SequenceOfIntegers)).ToList();
ints.ForEach(Console.WriteLine);
}
//Console.WriteLine(DateTime.Now.ToLongTimeString());
//Console.ReadLine();
}
private static List<TestCase> ReadLine()
{
int noOfTestCases = Convert.ToInt32(Console.ReadLine());
var testCases = new List<TestCase>();
for (int i = 0; i < noOfTestCases; i++)
{
string firstLine = Console.ReadLine();
string[] firstLineSplit = firstLine.Split(' ');
int N = Convert.ToInt32(firstLineSplit[0]);
int Q = Convert.ToInt32(firstLineSplit[1]);
var testCase = new TestCase
{
Queries = new List<Query>(),
SequenceOfIntegers = ReadLineAndGetSequenceOfIntegers()
};
for (int j = 0; j < Q; j++)
{
var buildQuery = ReadLineAndBuildQuery();
testCase.Queries.Add(buildQuery);
}
testCases.Add(testCase);
}
return testCases;
}
private static List<int> ReadLineAndGetSequenceOfIntegers()
{
string secondLine = Console.ReadLine();
List<int> sequenceOfIntegers = secondLine.Split(' ').ToArray().Select(x => Convert.ToInt32(x)).ToList();
return sequenceOfIntegers;
}
private static Query ReadLineAndBuildQuery()
{
var query = Console.ReadLine();
List<int> queryIntegers = query.Split(' ').ToArray().Select(x => Convert.ToInt32(x)).ToList();
Query buildQuery = ReadLineAndBuildQuery(queryIntegers[0], queryIntegers[1], queryIntegers[2]);
return buildQuery;
}
private static Query ReadLineAndBuildQuery(int a, int p, int q)
{
return new Query { a = a, p = p, q = q };
}
}
class CalculationManager
{
public int Calculate(Query query, List<int> sequenceOfIntegers)
{
var possibleIntegersToCalculate = FindPossibleIntegersToCalculate(sequenceOfIntegers, query.p, query.q);
int maxXorValue = possibleIntegersToCalculate.AsParallel().Max(x => x ^ query.a);
return maxXorValue;
}
private IEnumerable<int> FindPossibleIntegersToCalculate(List<int> sequenceOfIntegers, int p, int q)
{
return sequenceOfIntegers.GetRange(p - 1, (q - p) + 1).Distinct().ToArray();
}
}
class TestCase
{
public List<int> SequenceOfIntegers { get; set; }
public List<Query> Queries { get; set; }
}
class Query
{
public int a { get; set; }
public int p { get; set; }
public int q { get; set; }
}
}
unsafe
代码并在第一次避免边界检查。 - Marc Gravell