剑指Offer----面试题36：数组中的逆序对

题目：

在数组中的两个数字如果前面一个数字大于后面的数字，则这两个数字组成一个逆序对。输入一个数组，求出这个数组中的逆序对的总数。

方法一：

分析：扫描整个数组，每扫描一个数字的时候，逐个比较该数字和它后面的数字的大小。如果后面的数字比他小，则这两个数字就组成一个逆序对。时间复杂度为O(n2)。

代码：

#include<iostream>

using namespace std;

int Function(int *arr, int length)
{
	if (arr == nullptr || length <= 1)
		return 0;

	int num = 0;
	for (int i = 0; i < length - 1; ++i)
	{
		for (int j = i + 1; j < length; ++j)
		{
			if (arr[i] > arr[j])
				++num;
		}
	}

	return num;
}

void test1()
{
	cout << "===============test1:{7,5,6,4}================" << endl;
	int arr[] = { 7, 5, 6, 4 };
	int result = Function(arr, 4);
	cout << result << endl;
}

void test2()
{
	cout << "===============test1:{7,3}================" << endl;
	int arr[] = { 7, 3 };
	int result = Function(arr, 2);
	cout << result << endl;
}

void test3()
{
	cout << "===============test1:{7}================" << endl;
	int arr[] = { 7 };
	int result = Function(arr, 1);
	cout << result << endl;
}

void test4()
{
	cout << "===============test1:nullptr================" << endl;
	int *arr = nullptr;
	int result = Function(arr, 1);
	cout << result << endl;
}



int main()
{
	test1();
	test2();
	test3();
	test4();
	
	system("pause");
	return 0;
}

运行结果：

===============test1:{7,5,6,4}================
5
===============test1:{7,3}================
1
===============test1:{7}================
0
===============test1:nullptr================
0
请按任意键继续. . .

方法二：

源代码如下：

#include<iostream>

using namespace std;

int InversePairs(int *data, int length);
int InversePairsCore(int *data, int *copy, int start, int end);

int InversePairs(int *data, int length)
{
	if (data == nullptr || length <= 1)
		return 0;

	int *copy = new int[length];
	for (int i = 0; i < length; ++i)
		copy[i] = data[i];

	int count = InversePairsCore(data, copy, 0, length - 1);
	delete[] copy;

	return count;
}

int InversePairsCore(int *data, int *copy, int start, int end)
{
	if (start == end)
	{
		copy[start] = data[start];
		return 0;
	}

	int length = (end - start) / 2;
	int left = InversePairsCore(data, copy, start, start + length);
	int right = InversePairsCore(data, copy, start + length + 1, end);

	//i初始化为前半段最后一个数字的下标
	int i = start + length;
	//j初始化为后半段最后一个数字的下标
	int j = end;
	int indexCopy = end;
	int count = 0;
	while (i >= start && j >= start + length + 1)
	{
		if (data[i] > data[j])
		{
			copy[indexCopy--] = data[i--];
			count += j - start - length;
		}
		else
			copy[indexCopy--] = data[j--];
	}

	for (; i >= start; --i)
		copy[indexCopy--] = data[i];

	for (; j >= start + length + 1; j--)
		copy[indexCopy--] = data[j];

	return left + right + count;
}

void test11()
{
	cout << "===============test1:{7,5,6,4}================" << endl;
	int arr[] = { 7, 5, 6, 4 };
	int result = InversePairs(arr, 4);
	cout << result << endl;
}

void test12()
{
	cout << "===============test1:{7,3}================" << endl;
	int arr[] = { 7, 3 };
	int result = InversePairs(arr, 2);
	cout << result << endl;
}

void test13()
{
	cout << "===============test1:{7}================" << endl;
	int arr[] = { 7 };
	int result = InversePairs(arr, 1);
	cout << result << endl;
}

void test14()
{
	cout << "===============test1:nullptr================" << endl;
	int *arr = nullptr;
	int result = InversePairs(arr, 1);
	cout << result << endl;
}

int main()
{
	test11();
	test12();
	test13();
	test14();

	system("pause");
	return 0;
}

运行结果：

===============test1:{7,5,6,4}================
6
===============test1:{7,3}================
1
===============test1:{7}================
0
===============test1:nullptr================
0
请按任意键继续. . .

注意：该算法的时间复杂度为O(nlogn)，但是需要O(n)的空间复杂度，也就是用空间复杂度换取了时间复杂度。