暑假算法7.5，Day04

暑假算法7.5，Day04

第一题

合并两个有序数组

class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        for (int i = 0; i < n; ++i) {
            nums1[m + i] = nums2[i];
        }
        Arrays.sort(nums1);
    }
}

第二题

环形链表

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public boolean hasCycle(ListNode head) {
        if (head == null||head.next==null) {
            return false;
        }
        ListNode a = head;
        ListNode b = head.next;
        while (b != null && a != null) {
            if (b == a) {
                return true;
            }
            a = a.next;
            if (b.next != null) {
                b = b.next.next;
            } else {
                return false;
            }
        }
        return false;
    }
}

第三题

三数之和

class Solution {
    public List<List<Integer>> threeSum(int[] nums) {
        Arrays.sort(nums);
    List<List<Integer>> res = new ArrayList<>();
    int len = nums.length, cur = 0;
    while(cur <= len - 3){
        if(cur > 0 && nums[cur] == nums[cur - 1]) {
            cur++;
            continue;
        }
        int l = cur + 1, r = len - 1;
        if(nums[cur] > 0 || nums[r] < 0) break;
        while(l < r){
            int sum = nums[cur] + nums[l] + nums[r];
            if(sum == 0) {
                res.add(Arrays.asList(nums[cur], nums[l], nums[r]));
                while(l < r && nums[l] == nums[l + 1]) l++;
                while(l < r && nums[r] == nums[r - 1]) r--;
                l++;
                r--;
            }
            else if (sum > 0) r--;
            else l++;
        }
        cur++;
    }
    return res;
    }
}

第四题

Z mod X = C

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int a,b,c;
        cin>>a>>b>>c;
        int x,y,z;
        z = c;
        y = z + b;
        x = y + a;
        cout<<x<<' '<<y<<' '<<z<<endl;

    }
    return 0;
}