int removeDuplicates(int* nums, int numsSize) {
if(numsSize<2)return 0;
int cnt1 = 0, cnt2 = 1;
while (cnt2 < numsSize)
{
if (nums[cnt1] == nums[cnt2])
{
cnt2++;
}
else
{
nums[++cnt1] = nums[cnt2];
cnt2++;
}
}
return cnt1+1;
}
void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n) {
int c= m + n - 1;
m--; n--;
while (m >= 0 && n >= 0)
{
nums1[c--] = (nums1[m] > nums2[n]) ? nums1[m--] : nums2[n--];
}
if (n>= 0)
for (int i = n; i >= 0; i--)
nums1[c--] = nums2[i];
}
1海伦公式
double largestTriangleArea(int** points, int pointsSize, int* pointsColSize){
double max=0,x;
double p,a,b,c;
for(int i=0;i<pointsSize-2;i++)
for(int j=i+1;j<pointsSize-1;j++)
for(int k=j+1;k<pointsSize;k++)
{
a=sqrt(pow(points[i][0]-points[j][0],2)+
pow(points[i][1]-points[j][1],2));
b=sqrt(pow(points[k][0]-points[j][0],2)+
pow(points[k][1]-points[j][1],2));
c=sqrt(pow(points[k][0]-points[i][0],2)+
pow(points[k][1]-points[i][1],2));
p=(a+b+c)/2;
x=sqrt(p*(p-a)*(p-b)*(p-c));
if(x>max)max=x;
}
return max;
}
2鞋带公式S=0.5*(x1*y2+x2*y3+x3*y1-x2*y1-x3*y2-x1*y3)
double largestTriangleArea(int** points, int pointsSize, int* pointsColSize){
double max=0,x;
double x1,x2,x3,y1,y2,y3;
for(int i=0;i<pointsSize-2;i++)
for(int j=i+1;j<pointsSize-1;j++)
for(int k=j+1;k<pointsSize;k++)
{
x1=points[i][0];y1=points[i][1];
x2=points[j][0];y2=points[j][1];
x3=points[k][0];y3=points[k][1];
x=0.5*abs(x1*y2+x2*y3+x3*y1-x2*y1-x3*y2-x1*y3);
if(x>max)max=x;
}
return max;
}