civilizationV的博客

检查a出现最多1次 连续l 3次不奖励 char[] a = s.toCharArray(); int count1 = 0, count2 = 0; for (int i = 0; i < a.length; i++) { if ('A' == a[i]) count1++; }

class Solution { public int[] twoSum(int[] nums, int target) { for(int i=0;i<nums.length;i++){ for(int j=i+1;j<nums.length;j++){ if(target==nums[i]+nums[

90.Subsets II class Solution { public List<List<Integer>> subsetsWithDup(int[] nums) { Arrays.sort(nums);

Number of Subarrays with Bounded Maximum //子数组中最大的元素大于等于L小于等于R的子数组的最大个数 class Solution { public int numSubarrayBoundedMax(int[] A, int L, int R) { int j=0,count=0,res=0; ...