Leetcode-5147 Decrease Elements To Make Array Zigzag(递减元素使数组呈锯齿状)

#define _for(i,a,b) for(int i = (a);i < b;i ++)
typedef long long ll;
using namespace std;

class Solution
{
    public:
        int movesToMakeZigzag(vector<int>& nums)
        {
            int rnt1 = 0;
            int rnt2 = 0;
            
            _for(i,1,nums.size())
            {
                if(i&0x1)
                {
                    if(i==nums.size()-1)
                    {
                        if(nums[i]>=nums[i-1])
                        {
                            rnt1 += nums[i]-(nums[i-1]-1);
                        }
                    }
                    else
                    {
                        if(nums[i]>=nums[i-1] || nums[i]>=nums[i+1])
                        {
                            rnt1 += nums[i]-(min(nums[i-1],nums[i+1])-1);
                        }
                    }
                }
                
            }
            _for(i,0,nums.size())
            {
                
                if((i&0x1)==0)
                {
                    if(i==0)
                    {
                        if(nums[i]>=nums[i+1])
                        {
                            rnt2 += nums[i]-(nums[i+1]-1);
                        }
                    }
                    else if(i==nums.size()-1)
                    {
                        if(nums[i]>=nums[i-1])
                        {
                            rnt2 += nums[i]-(nums[i-1]-1);
                        }
                    }
                    else
                    {
                        if(nums[i]>=nums[i-1] || nums[i]>=nums[i+1])
                        {
                            rnt2 += nums[i]-(min(nums[i-1],nums[i+1])-1);
                        }
                    }
                }
            //    cout << rnt2 << endl;
            }
         //   cout << rnt1 << " " << rnt2 << endl;
            return min(rnt1,rnt2);
        }
};