• LeetCode 18. 4 Sum


    Title Description (medium difficulty) Similar to 3sum, it’s just to find four numbers so that the sum is target and there can’t be duplicate sequences. If you haven’t done 3sum before, you can take a look at it first. You just added a cycle on the basis of the above. public List<List<Integer>> fourSum(int[] num, int […]

  • How to find excellent open source projects


    1. Preface This article describes how to find excellent open source projects on GitHub and find the mine you want. GitHub, as the world’s largest same-sex dating website, is also a very rich mine. GitHub is sometimes more useful than Google, and if you don’t know how to use it to mine, you’re not a […]

  • Popular recommendation methods and skills on shaking speed


    How to quickly and quickly recommend hot audio, how to use the method and skills are all here. The jitter is very loud, and at the same time, there are a lot of big red nets, and more and more people want to shake their voice. However, after all, only a small number of people […]

  • What are the popular benefits of jitter?


    I believe you are familiar with the words like “praise”, “attention” and “popular“. Now a lot of software is used in this way, and the jitter is the best among them. Why do people who publish videos or articles will mention something like praise, comment, and hot stuff at the end? Is there any benefit […]

  • LeetCode 21. Merge Two Sorted Lists


    Title Description (simple difficulty) Merge two ordered lists. Solution one iteration Traverse two linked lists. public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode h = new ListNode(0); ListNode ans=h; while (l1 != null && l2 != null) { if (l1.val < l2.val) { h.next = l1; h = h.next; l1 = l1.next; } else { […]