lcp360

方法一：暴力

class Solution {
    public int furthestDistanceFromOrigin(String moves) {
        int n = moves.length();
        int cntL = 0, cntR = 0;
        for (int i = 0; i < n; ++i) {
            char ch = moves.charAt(i);
            if (ch == 'L')
                ++cntL;
            else if (ch == 'R')
                ++cntR;
        }
        return Math.abs(cntL - cntR) + n - (cntL + cntR);
    }
}

方法一：HashSet

class Solution {
    public long minimumPossibleSum(int n, int target) {
        long res = 0;
        HashSet<Integer> set = new HashSet<>();
        int cnt = 0, i = 1;
        while (cnt < n) {
            if (set.contains(target - i)) {
                ++i;
                continue;
            }
            set.add(i);
            res += i++;
            cnt++;
        }
        return res;
    }
}