摘要：
public void nextPermutation(int[] nums) { int i = nums.length -2; while(i>=0 && nums[i+1] <= nums[i]){ i--; } if(i>=0){ int j = nums.length -1; while( 阅读全文
摘要：
class Solution { public ListNode deleteNode(ListNode head, int val) { ListNode ln = head; ListNode p = new ListNode(); p.next = ln; head = p; while(ln 阅读全文