lcpBi110

第一题取整购买后的账户余额

class Solution {
    public int accountBalanceAfterPurchase(int purchaseAmount) {
        if (purchaseAmount == 100)
            return 0;
        if (purchaseAmount < 5)
            return 100;
        if (purchaseAmount < 10)
            return 90;
        int round = 0, min = 100;
        for (int i = 10; i <= 100; i += 10) {
            if (Math.abs(i - purchaseAmount) <=  min) {
                round = i;
                min = Math.abs(i - purchaseAmount);
            }
        }
        return 100 - round;
    }
}

第二题在链表中插入最大公约数

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode insertGreatestCommonDivisors(ListNode head) {
        ListNode cur = head;
        while (cur.next != null) {
            ListNode next = cur.next;
            int val = calc(cur.val, next.val);
            ListNode x = new ListNode(val, next);
            cur.next = x;
            cur = next;
        }
        return head;
    }

    private int calc(int a, int b) {
        int min = Math.min(a, b);
        int res = 1;
        for (int i = 1; i <= min; ++i) {
            if (a % i == 0 && b % i == 0)
                res = i;
        }
        return res;
    }
}