题目描述如下:
本人解答:
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
class NumWithIndex
{
public:
int index;
int num;
bool tag;
};
bool comparingNum(NumWithIndex &a, NumWithIndex &b)
{
return a.num < b.num;
};
class Solution
{
public:
int maxNumOfMarkedIndices(vector<int> &nums)
{
// 构造带序号的数组类,并排序
vector<NumWithIndex> numsIndex{nums.size()};
for (int i = 0; i < nums.size(); i++)
{
numsIndex[i].index = i;
numsIndex[i].num = nums[i];
numsIndex[i].tag = false;
}
sort(numsIndex.begin(), numsIndex.end(), comparingNum);
// 开始打标签
int count = 0;
int size = numsIndex.size();
for (int i = 0; i < size; i++)
{
if (2 * numsIndex[i].num > numsIndex[size - 1].num)
break;
// 若前面有元素比自己两倍大,并且未被标记,则标记
for (int j = i + 1; j < size; j++)
{
if (2 * numsIndex[i].num <= numsIndex[j].num && !numsIndex[i].tag && !numsIndex[j].tag)
{
numsIndex[j].tag = true;
count += 2;
break;
}
}
}
return count;
};
};
int main()
{
vector<int> nums = {1, 2, 3, 4};
Solution solution;
cout << solution.maxNumOfMarkedIndices(nums);
system("pause");
};
漏洞:
就像在main里的这个例子,这种情况很难搞
正解:
1.二分查找。代码暂时没看懂。
2.双指针。注意到,排序后二分,左侧的数匹配的一定是右侧的数。用原代码修改后TLE;减少不必要的遍历后卡两个点。
卡两个点的代码
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
bool comparingNum(int a, int b)
{
return a < b;
};
class Solution
{
public:
int maxNumOfMarkedIndices(vector<int> &nums)
{
// 排序
sort(nums.begin(), nums.end(), comparingNum);
// 开始打标签
int count = 0;
int size = nums.size();
int startIndex = size / 2;
for (int i = 0, j = startIndex; i < startIndex && j < size; i++)
{
while (j < size && 2 * nums[i] > nums[j])
{
j++;
}
if (j < size)
{
count += 2;
j++;
}
}
return count;
};
};
int main()
{
vector<int> nums = {1, 2, 3, 4};
Solution solution;
cout << solution.maxNumOfMarkedIndices(nums);
system("pause");
};
修改后:
打标签部分改为:
反思:暂时不懂for循环和while循环的区别在哪儿,如果有大佬的话希望解答