John_Zaey的博客

面试题 08.06. 汉诺塔问题class Solution { public void hanota(List<Integer> A, List<Integer> B, List<Integer> C) { if(A==null) return; recurse(A, B, C, A.size()); } public void recurse(List<Integer> src, List<

本周两题均可使用双端队列剑指 Offer 59 - I. 滑动窗口的最大值class Solution { public int[] maxSlidingWindow(int[] nums, int k) { if(nums==null || nums.length<=0) return new int[0]; int start = 0, end = 0; int[] res = new int[nums.length-k+1];

2. 两数相加public ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode dumbHead = new ListNode(-1); ListNode tmp = dumbHead; int advance = 0; while(l1!=null&&l2!=null) { int sum = l1.val + l2.val + advance; if(su