bluegrass986的专栏

lesson 1: PermMissingElempackage com.lesson1;import java.util.BitSet;/** * A zero-indexed array A consisting of N different integers is given. The array * contains integers in the range

FrogRiverOne package com.lesson2;import java.util.BitSet;/** *  * A small frog wants to get to the other side of a river. The frog is currently * located at position 0, and wants to ge

package com.lesson2;/** * * You are given N counters, initially set to 0, and you have two possible * operations on them: increase(X) − counter X is increased by 1, max counter − * all counters

package com.lesson2;import java.util.BitSet;/** * * Write a function: class Solution { public int solution(int[] A); } that, * given a non-empty zero-indexed array A of N integers, returns the