Skip to content

Commit

Permalink
Update 327.Count-of-Range-Sum.cpp
Browse files Browse the repository at this point in the history
  • Loading branch information
wisdompeak authored Jun 27, 2022
1 parent e74d781 commit de74fd8
Showing 1 changed file with 32 additions and 30 deletions.
62 changes: 32 additions & 30 deletions Divide_Conquer/327.Count-of-Range-Sum/327.Count-of-Range-Sum.cpp
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
class Solution {
int result;
long temp[100001];
long temp[100005];
public:
int countRangeSum(vector<int>& nums, int lower, int upper)
{
Expand All @@ -26,34 +26,36 @@ class Solution {
result+=p2-p1;
}

int i=a, j=mid+1, p = 0;
while (i<=mid && j<=b)
{
if (nums[i]<=nums[j])
{
temp[p] = nums[i];
i++;
}
else
{
temp[p] = nums[j];
j++;
}
p++;
}
while (i<=mid)
{
temp[p] = nums[i];
i++;
p++;
}
while (j<=b)
{
temp[p] = nums[j];
j++;
p++;
}
for (int i=0; i<b-a+1; i++)
nums[a+i] = temp[i];
inplace_merge(nums.begin()+a, nums.begin()+mid+1, nums.begin()+b+1);

// int i=a, j=mid+1, p = 0;
// while (i<=mid && j<=b)
// {
// if (nums[i]<=nums[j])
// {
// temp[p] = nums[i];
// i++;
// }
// else
// {
// temp[p] = nums[j];
// j++;
// }
// p++;
// }
// while (i<=mid)
// {
// temp[p] = nums[i];
// i++;
// p++;
// }
// while (j<=b)
// {
// temp[p] = nums[j];
// j++;
// p++;
// }
// for (int i=0; i<b-a+1; i++)
// nums[a+i] = temp[i];
}
};

0 comments on commit de74fd8

Please sign in to comment.