js54100804的专栏

public class Solution { /* * @param nums: A list of integers. * @return: A list of permutations. */ public List> permute(int[] nums) { List> result = new ArrayList>();

public boolean searchMatrix(int[][] matrix, int target) { if(matrix == null || matrix.length == 0) return false; if(matrix[0] == null || matrix[0].length == 0) return false; int m

public class Solution { /** * O(m + n) 时间复杂度 */ public int searchMatrix(int[][] matrix, int target) { if(matrix == null || matrix.length == 0) return 0; if(matrix[0]

public class Solution { /** * @param nums: an array of integers * @return: return nothing (void), do not return anything, modify nums in-place instead */ public int[] nextPerm

public class Solution { /* * @param nums: A list of integers * @return: A list of integers that's previous permuation */ public List previousPermuation(List nums) { i