467-82（15、33、103、82）

15. 三数之和

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {

        vector<vector<int>> result;

        sort(nums.begin(), nums.end());


        for (int i = 0; i < nums.size(); i++)
        {
            if (nums[i] > 0)
            {
                return result;
            }

            if (i > 0 && nums[i] == nums[i - 1])
            {
                continue;
            }

            int left = i + 1;
            int right = nums.size() - 1;

            while (right > left)
            {
                if (nums[i] + nums[left] + nums[right] > 0)
                {
                    right--;
                    while (right > left && nums[right] == nums[right + 1]) right--;
                }
                else if (nums[i] + nums[left] + nums[right] < 0)
                {
                    left++;
                    while (right > left && nums[left] == nums[left - 1])   left++;
                }
                else
                {
                    result.push_back(vector<int>{nums[i], nums[left], nums[right]});
                    //去重，在i不变的情况下，只有right--和left++才有可能得到下一个和为0的数组，nums是递增的！
                    while (left < right && nums[right] == nums[right-1]) right--;
                    while (left < right && nums[left] == nums[left+1]) left++;

                    right--;
                    left++;
                }
            }
        }
        return result;
    }
};

33. 搜索旋转排序数组

class Solution
{
public:
	int search(vector<int>& nums, int target)
	{
		int n = nums.size();
		if (n == 0)	return -1;

		if (n == 1)
		{
			return nums[0] == target ? 0 : -1;
		}

		int left = 0, right = n - 1;


		while (left <= right)
		{
			int mid = left + ((right - left) >> 1);

			if (nums[mid] == target)
			{
				return mid;
			}
			//右边有序
			else if (nums[mid] < nums[right])
			{
				//nums[mid] < target && target <= nums[right]:保证 mid+1 ~right 有序
				if (nums[mid] < target && target <= nums[right])
				{
					left = mid + 1;
				}

				else
				{
					right = mid - 1;
				}
			}
			//左边有序
			else
			{
				//nums[mid] > target && target >= nums[left]: 保证left ~ mid-1有序
				if (nums[mid] > target && target >= nums[left])
				{
					right = mid - 1;
				}
				else
				{
					left = mid + 1;
				}
			}
		}
		return -1;
	}
};

103. 二叉树的锯齿形层序遍历

class Solution
{
public:
	vector<vector<int>> zigzagLevelOrder(TreeNode* root)
	{
		queue<TreeNode*> que;
		if (root != nullptr)	que.push(root);

		vector<vector<int>> res;
		bool flag = false;

		while (!que.empty())
		{
			int size = que.size();
			vector<int> temp;

			for (int i = 0; i < size; i++)
			{
				TreeNode* node = que.front();
				que.pop();
				temp.push_back(node->val);

				if (node->left)		que.push(node->left);
				if (node->right)	que.push(node->right);
			}

			if (flag)
			{
				reverse(temp.begin(), temp.end());
				res.push_back(temp);
			}
            else
            {
			    res.push_back(temp);
            }
            flag = !flag;
		}
		return res;
	}
};

82. 删除排序链表中的重复元素 II

class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {

        ListNode* dummy_node = new ListNode(0);

        dummy_node->next = head;

        ListNode* cur = dummy_node;

        while (cur->next && cur->next->next)
        {
            if (cur->next->val == cur->next->next->val)
            {
                int n = cur->next->val;
                while (cur->next && cur->next->val == n)
                {
                    cur->next = cur->next->next;
                }
            }
            else
            {
                cur = cur->next;
            }
        }
        return dummy_node->next;
    }
};