-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path36_InversePairs.cpp
More file actions
111 lines (94 loc) · 2.02 KB
/
Copy path36_InversePairs.cpp
File metadata and controls
111 lines (94 loc) · 2.02 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
#include <iostream>
using namespace std;
int merge(int* data, int* tmp, int start, int mid, int end)
{
int i = mid;
int j = end;
int k = end;
int sum = 0;
while ((i >= start) && (j > mid))
{
if (data[i] > data[j])
{
tmp[k] = data[i];
sum += j - mid;
i--;
}
else
{
tmp[k] = data[j];
j--;
}
k--;
}
while (i >= start)
{
tmp[k] = data[i];
k--;
i--;
}
while (j > mid)
{
tmp[k] = data[j];
j--;
k--;
}
for (int index= start; index <= end; index++)
data[index] = tmp[index];
return sum;
}
int inversePairsCore(int* data, int* tmp, int start, int end)
{
int sum = 0;
if (start < end)
{
int mid = (start+end)/2;
int leftSum = inversePairsCore(data, tmp, start, mid);
int rightSum = inversePairsCore(data, tmp, mid+1, end);
int mergeSum = merge(data, tmp, start, mid, end);
sum = leftSum + rightSum + mergeSum;
}
return sum;
}
int inversePairs(const int* nums, int length)
{
if (nums == NULL || length <= 0)
return 0;
int* data = new int[length];
for (int i = 0; i < length; i++)
data[i] = nums[i];
int* tmp = new int[length];
return inversePairsCore(data, tmp, 0, length-1);
}
//=================Test code=========================
static void test(const char* testName, const int* nums, int length, int expected)
{
cout << testName << " " << "Begins: ";
int count = inversePairs(nums, length);
if (count == expected)
cout << "Passed." << endl;
else
cout << "Failed" << endl;
}
static void test1()
{
int nums[] = {7, 5, 6, 4};
test("test1", nums, 4, 5);
}
static void test2()
{
int* nums = NULL;
test("test2", nums, 0, 0);
}
static void test3()
{
int nums[] = {1,2,3,4};
test("test3", nums, 4, 0);
}
int main()
{
test1();
test2();
test3();
return 0;
}