摘要：
Map<Character,Integer> ori = new HashMap<>(); Map<Character,Integer> cnt = new HashMap<>(); //这里用了两个哈希表 public String minWindow(String s, String t) { 阅读全文
摘要：
public ListNode getIntersectionNode(ListNode headA, ListNode headB) { if (headA == null || headB == null) { return null; } ListNode node1 = headA, nod 阅读全文
摘要：
public int findNthDigit(int n) { int digit = 1; long start = 1; long count = 9; while (n > count) { // 1. n -= count; digit += 1; start *= 10; count = 阅读全文
摘要：
public String minNumber(int[] nums) { String[] strs = new String[nums.length]; for(int i = 0; i < nums.length; i++) strs[i] = String.valueOf(nums[i]); 阅读全文
摘要：
public int translateNum(int num) { //动态规划 if(num<10) return 1; String s = String.valueOf(num); int len = s.length(); int[] dp = new int[len+1]; dp[0] 阅读全文
摘要：
public int maxValue(int[][] grid) { //动态规划 int m = grid.length; int n = grid[0].length; for(int i = 1;i<n;i++){ grid[0][i] = grid[0][i] + grid[0][i-1] 阅读全文
摘要：
public int lengthOfLongestSubstring(String s) { //用哈希表存储 int len = s.length(); if(len<=1) return len; char[] c = s.toCharArray(); HashMap<Character,In 阅读全文
摘要：
public int nthUglyNumber(int n) { int a = 0,b = 0,c = 0; int[] dp = new int[n]; dp[0] = 1; for(int i = 1;i<n;i++){ int n2 = dp[a]*2,n3 = dp[b]*3,n5 = 阅读全文
摘要：
public int singleNumber(int[] nums) { int ones = 0, twos = 0; for(int num : nums){ ones = ones ^ num & ~twos; twos = twos ^ num & ~ones; } return ones 阅读全文
摘要：
class Solution { public int[] singleNumbers(int[] nums) { Arrays.sort(nums); int i = 1,j = 0; int c = 0; ArrayList<Integer> list = new ArrayList<>(); 阅读全文