AXIMI的博客

提交代码class Solution { public int maxProfit(int[] prices) { if(prices==null||prices.length==0) return 0; int res=0,in=prices[0],out=prices[0]; for(Integer price:prices) { ...

和使用三个指针翻转链表的思路差不多。提交代码class Solution { public ListNode reverseKGroup(ListNode head, int k) { ListNode p=head; for(int i=0;i<k;i++) { if(p==null) return head; p=p.next; ...

提交代码class Solution { public int maxArea(int[] height) { int maxLeft=0,maxRight=0,curArea=0,maxArea=0; for(int i=0;i<height.length;i++) { if(height[i]<maxLeft) continue...

用个单调栈提交代码class Solution { public int trap(int[] height) { Stack<Integer> hStack=new Stack<Integer>(); Stack<Integer> pStack=new Stack<Integer>(); int...