leetcode笔记 83. Remove Duplicates from Sorted List & 88. Merge Sorted Array

leetcode刷题13天
83. Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.

Example 1:

Input: 1->1->2
Output: 1->2
Example 2:

Input: 1->1->2->3->3
Output: 1->2->3

代码：

class Solution {
    public ListNode deleteDuplicates(ListNode head) {
    	if(head==null)
    		return null;
    	if(head.next==null)
    		return head;
    	ListNode temp1 = head;
    	ListNode temp2 =  head.next;
    	while(temp2!=null) {
    		if(temp1.val==temp2.val) {
    			temp2 = temp2.next;
    			temp1.next = null;
    		}
    		else {
    			temp1.next = temp2;
                temp1 = temp2;
                temp2 = temp2.next;
    		}
    	}
    	return head;
    }
}

88. Merge Sorted Array
    Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

The number of elements initialized in nums1 and nums2 are m and n respectively.
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
Example:

Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3

Output: [1,2,2,3,5,6]

代码：

class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
          
        int i = m-1;
        int j = n-1;
        int k = nums1.length-1;
        while(k>=0) {
        	if(i<0&&j>=0) {
        		nums1[k] = nums2[j];
        		j--;
        		k--;
        		continue;
        	}
        	if(j<0&&i>=0) {
        		nums1[k] = nums1[i];
        		i--;
        		k--;
        		continue;
        	}
        	if(nums1[i]>nums2[j]) {
        		nums1[k]=nums1[i];
        		i--;
        	}
        	else {
        		nums1[k]=nums2[j];
        		j--;
        	}
        	k--;
        }
    }
}