s546889的博客

//状态机或者说是动态规划，看题解过程更好理解class Solution { public int maxProfit(int[] prices) { if(prices.length == 0 || prices == null){ return 0; } int n = prices.length; int[][] dp = new int[n][2]; for(int i = 0; i.

//动态规划的好例子,优化和数学方法暂时不深究，先学会走路。class Solution { public int uniquePaths(int m, int n) { int[][] dp = new int[m][n]; for(int i = 0; i < m; i++) dp[i][0] = 1;; for(int j = 0; j < n; j++) dp[0][j] = 1; for(int i = 1; .

//对BFS的理解会更加通彻class Solution { public int openLock(String[] deadends, String target) { //保存死亡数字.为什么要保存？ //因为可以使用contains方法判断, 而不需要for循环遍历数组 Set<String> deads = new HashSet<String>(); for(String s : deadends.

//贪心算法class Solution { public String intToRoman(int num) { int[] values = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1}; String[] symbols = {"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"}; StringBuilde.

//双指针法class Solution { public int maxArea(int[] height) { int i = 0, r = height.length - 1; int ans = 0; while(i < r){ int area = Math.min(height[i], height[r]) * (r - i); ans = Math.max(ans, area).

//主要考过滤处理class Solution { public int myAtoi(String str) { if(str==null || str.length()<=0) return 0; //正负数的最大最小值 int MAX = Integer.MAX_VALUE,MIN=Integer.MIN_VALUE; int res = 0, index = 0; //过滤开头空格 .

//此题主要考点是对溢出的考虑class Solution { public int reverse(int value) { int res = 0; while(value != 0 ){ int tmp = value % 10; if(res > 214748364 || res==214748364 && tmp > 7){ return 0; .

//按行访问(每一行放入单独的容器)class Solution { public String convert(String s, int numRows) { if(s == null || s.length() == 0 || numRows <=1 || numRows > s.length()) return s; StringBuilder[] array = new StringBuilder[numRows]; fo.

//动态规划 => 通过把原问题分解为相对简单的子问题的方式求解复杂问题的方法。动态规划常常适用于有重叠子问题和最优子结构性质的问题。class Solution { public String longestPalindrome(String s) { int len = s.length(); if(len < 2){ return s; } int maxLen = 1; .

class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { //判断是偶数个还是奇数个 int length1 = nums1.length, length2 = nums2.length; int totalLength = length1 + length2; if (totalLength % 2 == 1) { i.

class Solution { public int lengthOfLongestSubstring(String s) { // 哈希集合，记录每个字符是否出现过 Set<Character> occ = new HashSet<Character>(); int n = s.length(); // 右指针，初始值为 -1，相当于我们在字符串的左边界的左侧，还没有开始移动。rk = -1 比 rk = .

public ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode dummyHead = new ListNode(0); ListNode p = l1, q = l2, curr = dummyHead; int carry = 0; while (p != null || q != null) { int x = (p != null) ? p.val : 0; int.

//一遍hash表class Solution { public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> map = new HashMap<>(); for (int i = 0; i < nums.length; i++) { int complement = target - nums[i]; if .