Java 다이어리 2018-05-30

public static double Power(double base, int expon) {
        //  
        if (expon == 0)
            return 1;
        if (expon == 1)
            return base;
        double pow = Power(base * base, expon / 2);
        if (expon % 2 != 0) {
            pow = pow * base;
        }
        return pow;
    }

//n 
    public static void printMax(int n) {
        if(n<1) return;
        StringBuffer s= new StringBuffer(n);
        for(int i=0;i

public static ListNode deleteNode(ListNode head, ListNode tobeDelete) {
        if(head==null || head.next==null || tobeDelete == null) return null;
        if(tobeDelete.next!=null) {
            // ， ， 
            ListNode next=tobeDelete.next;
            tobeDelete.val=next.val;
            tobeDelete.next= next.next;
        } else {
            ListNode cur=head;
            while(cur.next != tobeDelete){
                cur=cur.next;
            }
            cur.next=null;
        }
        return head;
    }

// 
    public static ListNode deleteDuplication(ListNode pHead) {
        if (pHead == null || pHead.next == null)
            return pHead;
        ListNode next = pHead.next;
        // ， ； ， 
        if (pHead.val == next.val) {
            while (next != null && pHead.val == next.val)
                next = next.next;
            return deleteDuplication(next);
        } else {
            pHead.next = deleteDuplication(pHead.next);
            return pHead;
        }
    }