![](https://i-blog.csdnimg.cn/blog_migrate/b7863a16a4f7eeffffa9cef1b9296e35.png)
![](https://i-blog.csdnimg.cn/blog_migrate/07df583b1a26071b6f8e36d0ba8a461e.png)
int finalValueAfterOperations(char ** operations, int operationsSize)
{
int x=0;
int i = 0;
for(i=0;i<operationsSize;i++)
{
if(operations[i][1]=='-')
x--;
else
x++;
}
return x;
}
本题是将输入的字符串看成二维数组,仅观察每行元素的中间元素即可发现规律。
![](https://i-blog.csdnimg.cn/blog_migrate/ebbda8eb96070b178b4a034dde72e481.png)
int maximumDifference(int* nums, int numsSize)
{
int i = 0;
int j = 0;
int max = 0;
int ret = 0;
for(j=1;j<numsSize;j++)
{
for(i=0;i<j;i++)
{
if(nums[j]-nums[i]>0)
{
ret = nums[j]-nums[i];
}
max = ret>max?ret:max;
}
}
if(max>0)
{
return max;
}
else
{
return -1;
}
}