zxwtry的博客

详细见：leetcode.com/problems/container-with-most-water/Java Solution: githubpackage leetcode;public class P011_ContainerWithMostWater { /** * @author zxwtry * @email zxwtr

详细见：leetcode.com/problems/longest-common-prefix/Java Solution: githubpackage leetcode;public class P014_LongestCommonPrefix { public static void main(String[] args) { } /* * 2 ms *

详细见：leetcode.com/problems/3sumJava Solution: githubpackage leetcode;import java.util.Arrays;import java.util.LinkedList;import java.util.List;public class P015_3SumEquals0 { public st

详细见：leetcode.com/problems/combination-sum-iiC和Python的去重算法，应该记住。Java是很久之前写的，并不好。规则是：相同数字。        1，前面选了，后面一定要选。        2，前面没选，后面可选可不选。注意一定要选到最后一位，才能判断。Java Solution: githubp

详细见：leetcode.com/problems/first-missing-positiveJava所用的算法不够清晰，见C和Python的while循环while的作用：将val的值放置到val-1的位置上Java Solution: githubpackage leetcode;public class P041_FirstMissingPositi

详细见：leetcode.com/problems/combination-sumJava Solution: githubpackage leetcode;import java.util.Arrays;import java.util.LinkedList;import java.util.List;public class P039_Combination_S

详细见：leetcode.com/problems/trapping-rain-water很经典Java Solution: githubpackage leetcode;/* * 最大积水问题 */public class P042_TrappingRainWater { public static void main(String[] args)

详细见：leetcode.com/problems/3sum-closestJava Solution: githubpackage leetcode;import java.util.Arrays;public class P016_3SumClosest { public static void main(String[] args) {// System.o

详细见：leetcode.com/problems/letter-combinations-of-a-phone-number/Java Solution: githubpackage leetcode;import java.util.LinkedList;import java.util.List;/* * Given a digit string, retur

详细见：leetcode.com/problems/4sum/Java Solution: githubpackage leetcode;import java.util.Arrays;import java.util.HashMap;import java.util.HashSet;import java.util.Iterator;import java.uti

详细见：leetcode.com/problems/multiply-stringsJava Solution: githubpackage leetcode;public class P043_MultiplyStrings { public static void main(String[] args) {// System.out.println(new Sol

详细见：leetcode.com/problems/wildcard-matchingJava Solution: githubpackage leetcode;public class P044_WildcardMatching { /* * 35 ms * 54.88% */ static class Solution4 { public bo

详细见：leetcode.com/problems/jump-game-iiJava Solution: githubpackage leetcode;/* 大致意思是： 从0开始跳，每次跳的步数 <= 当前的值 结果就是要跳到最后一个 求跳最少次数 */public class P045_JumpGameII { /* * 4 ms *

详细见：leetcode.com/problems/permutationsJava Solution: githubpackage leetcode;import java.util.Arrays;import java.util.LinkedList;import java.util.List;public class P046_Permutations {

详细见：leetcode.com/problems/permutations-iiJava Solution: githubpackage leetcode;import java.util.LinkedList;import java.util.List;public class P047_PermutationsII { /* * 先用HashSet试

详细见：leetcode.com/problems/rotate-imageJava Solution: githubpackage leetcode;public class P048_RotateImage { /* * 0 ms * 26.00% */ static class Solution1 { public void rotate

详细见：leetcode.com/problems/remove-nth-node-from-end-of-listJava Solution: githubpackage leetcode;public class P019_RemoveNthFromEndOfList { /* * 1ms * 5.49% */ static class Solu

详细见：leetcode.com/problems/valid-parenthesesJava Solution: githubpackage leetcode;public class P020_ValidParentheses { public static void main(String[] args) {// System.out.println(new

详细见：leetcode.com/problems/merge-two-sorted-listsJava Solution: githubpackage leetcode;import tools.ListNode辅助.ListNode;public class P021_MergeTwoSortedLists { // 注意，最好不要新建ListNode /*

详细见：leetcode.com/problems/anagramsJava Solution: githubpackage leetcode;import java.util.ArrayList;import java.util.Arrays;import java.util.HashMap;import java.util.LinkedList;import j

详细见：leetcode.com/problems/powx-nJava Solution: githubpackage leetcode;public class P050_PowXN { /* * 1 ms * 37.87% */ static class Solution1 { public double myPow(double x,

详细见：leetcode.com/problems/n-queensJava Solution: githubpackage leetcode;import java.util.LinkedList;import java.util.List;public class P051_NQueens { public static void main(String[] a

详细见：leetcode.com/problems/generate-parentheses/Java Solution: githubpackage leetcode;import java.util.HashSet;import java.util.LinkedList;import java.util.List;public class P022_Genera

详细见：leetcode.com/problems/merge-k-sorted-lists/解析：两两合并(Java)，堆排序(C和Python)Java Solution: githubpackage leetcode;public class P023_MergeKSortedLists { /* * 1 2方法太垃圾了， * 改用两次合并法

详细见：leetcode.com/problems/swap-nodes-in-pairs/Java Solution: githubpackage leetcode;import tools.ListNode辅助.ListNode;public class P024_SwapNodesInPairs { public static void main(String

详细见：leetcode.com/problems/add-two-numbers/说明：链表操作+进位Java Solution: githubpackage leetcode;/*You are given two linked lists representing two non-negative numbers. The digits are stored in reverse ...

详细见：leetcode.com/problems/reverse-nodes-in-k-groupJava Solution: githubpackage leetcode;/* * 25. Reverse Nodes in k-Group QuestionEditorial Solution My Submissions Total Accepted: 67154 T

详细见：leetcode.com/problems/remove-duplicates-from-sorted-array/Java Solution: githubpackage leetcode;public class P026_RemoveDuplicatesFromSortedArray { public static void main(String[] args)

详细见：leetcode.com/problems/remove-element/Java Solution: githubpackage leetcode;public class P027_RemoveElement { public static void main(String[] args) { int[] nums = {1, 2, 3, 4, 3, 2, 1,

详细见：leetcode.com/problems/n-queens-iiJava Solution: githubpackage leetcode;public class P052_NQueensII { public static void main(String[] args) { System.out.println(new Solution1().tota

详细见：leetcode.com/problems/maximum-subarrayJava Solution: githubpackage leetcode;public class P053_MaximumSubarray { public static void main(String[] args) { System.out.println(new Solut

详细见：leetcode.com/problems/spiral-matrixJava Solution: githubpackage leetcode;import java.util.LinkedList;import java.util.List;public class P054_SpiralMatrix { public static void main(

详细见：leetcode.com/problems/longest-substring-without-repeating-characters/说明：map/dict/数组Java Solution:  githubpackage leetcode;import java.util.Arrays;public class P003_LongestSub

详细见：leetcode.com/problems/median-of-two-sorted-arrays/haracters/说明： 同时找两个，情况太多。精简成找一个就好了。Java Solution: githubpackage leetcode;/*There are two sorted arrays nums1 and nums2 of

详细见：leetcode.com/problems/implement-strstrJava Solution: githubpackage leetcode;public class P028_ImplementStrStr { //AC 13ms 34.88% static class Solution { public int strStr(String

详细见：leetcode.com/problems/divide-two-integersJava Solution: githubpackage leetcode;public class P029_DivideTwoIntegers { /* * 这个方法会TLE */ static class Solution1 { public int div

详细见：leetcode.com/problems/substring-with-concatenation-of-all-wordsJava Solution: githubpackage leetcode;import java.util.Arrays;import java.util.HashMap;import java.util.LinkedList;imp

详细见：leetcode.com/problems/longest-palindromic-substring/说明： manacherJava Solution: githubpackage leetcode;/* * 假定存在唯一一个最长子序列 */public class P005_LongestPalindromicSubstring { public sta

详细见： leetcode.com/problems/zigzag-conversion/Java Solution: githubpackage leetcode;import java.util.Arrays;/*6. ZigZag Conversion QuestionEditorial Solution My SubmissionsTotal Accep

详细见：leetcode.com/problems/reverse-integer/Java Solution: githubpackage leetcode;/* * 7. Reverse Integer QuestionEditorial Solution My SubmissionsTotal Accepted: 156921Total Submissions: