摘要：
Description: Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image. To flip an image horizon 阅读全文
摘要：
Description: Given words first and second, consider occurrences in some text of the form "first second third", where second comes immediately after fi 阅读全文
摘要：
Description Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial w 阅读全文
摘要：
Description here is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 阅读全文
摘要：
Description The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two p 阅读全文
摘要：
Description Given a valid (IPv4) IP address, return a defanged version of that IP address. A defanged IP address replaces every period "." with "[.]". 阅读全文
摘要：
Description On an 8 x 8 chessboard, there is one white rook. There also may be empty squares, white bishops, and black pawns. These are given as chara 阅读全文
摘要：
Description Solution 阅读全文
摘要：
class Solution { public int maxProduct(int[] nums) { if(nums == null || nums.length ==0){ return 0; } int max = nums[0]; int min... 阅读全文
摘要：
class Solution { public int uniquePaths(int m, int n) { if (m ==0||n ==0){ return 0; } int dp [][] = new int[m][n]; //firs... 阅读全文
摘要：
class Solution { public int minFallingPathSum(int[][] A) { if(A== null|| A.length==0 || A[0].length ==0 ){ return 0; } int n = A.length ;... 阅读全文