摘要：
class Solution { public static void main(String[] args) { Solution solution = new Solution(); System.out.println(solution.longestSubsequence("1001010" 阅读全文
posted @ 2022-06-22 15:57
fishcanfly
阅读(42)
评论(0)
推荐(0)
摘要：
class Solution { public static void main(String[] args) { Solution solution = new Solution(); solution.countSubarrays(new int[]{ 2,1,4,3,5 },10); } pu 阅读全文
posted @ 2022-06-17 18:44
fishcanfly
阅读(38)
评论(0)
推荐(0)
摘要：
import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.Arrays; public class Main { public static void main(String[] args) t 阅读全文
posted @ 2022-06-12 19:14
fishcanfly
阅读(52)
评论(0)
推荐(0)
摘要：
import java.util.HashSet; import java.util.Set; class Solution { public long distinctNames(String[] ideas) { int[][] cnt = new int[26][26]; boolean[][ 阅读全文
posted @ 2022-06-12 17:29
fishcanfly
阅读(25)
评论(0)
推荐(0)
摘要：
class Solution { public int minFlipsMonoIncr(String s) { int len = s.length(); int[][] dp = new int[len][2]; if (s.charAt(0) == '0') { dp[0][0] = 0; d 阅读全文
posted @ 2022-06-11 19:15
fishcanfly
阅读(19)
评论(0)
推荐(0)
摘要：
import java.util.Arrays; class Solution { public int numSubseq(int[] nums, int target) { Arrays.sort(nums); int len = nums.length; long ans = 0l; for 阅读全文
posted @ 2022-06-08 21:49
fishcanfly
阅读(29)
评论(0)
推荐(0)
摘要：
class Solution { public int minEatingSpeed(int[] piles, int h) { int ans = 0; int low = 1; int high = 1000000001; while(low<high){ int mid = ( low +hi 阅读全文
posted @ 2022-06-07 18:46
fishcanfly
阅读(21)
评论(0)
推荐(0)
摘要：
class Solution { public static void main(String[] args) { Solution solution = new Solution(); int ans = solution.videoStitching(new int[][]{ {8,10},{1 阅读全文
posted @ 2022-06-07 11:06
fishcanfly
阅读(122)
评论(0)
推荐(0)
摘要：
//只需要考虑前6位的状态，i这种状态和i+6这个状态是一样的import java.util.ArrayDeque; import java.util.Arrays; import java.util.HashSet; class Solution { public static void mai 阅读全文
posted @ 2022-06-06 17:09
fishcanfly
阅读(30)
评论(2)
推荐(0)
摘要：
class MyCalendarThree { private TreeMap<Integer, Integer> cnt; public MyCalendarThree() { cnt = new TreeMap<Integer, Integer>(); } public int book(int 阅读全文
posted @ 2022-06-06 15:29
fishcanfly
阅读(31)
评论(0)
推荐(0)
浙公网安备 33010602011771号