Array
文章平均质量分 53
liujunlovecs
这个作者很懒,什么都没留下…
展开
-
Best Time To Buy and Sell Stock
public class Solution { public int maxProfit(int[] prices) { int profit = 0; if (prices == null || prices.length < 2) { return profit; }原创 2015-07-28 09:16:19 · 212 阅读 · 0 评论 -
Leetcode#59||Spiral Matrix II
public class Solution { public int[][] generateMatrix(int n) { int[][] result = new int[n][n]; int t= 0; int cnt = 1; while (t < n / 2) {原创 2015-08-17 18:14:04 · 302 阅读 · 0 评论 -
Leetcode#57||Insert Interval
/** * Definition for an interval. * public class Interval { * int start; * int end; * Interval() { start = 0; end = 0; } * Interval(int s, int e) { start = s; end = e; } * } */原创 2015-08-17 15:42:29 · 249 阅读 · 0 评论 -
Leetcode#55||Jump Game
public class Solution { public boolean canJump(int[] nums) { if (nums == null || nums.length == 0) { return false; } int maxRange = 0;原创 2015-08-17 14:51:24 · 417 阅读 · 0 评论 -
Leetcode#54||Spiral Matrix
public class Solution { public List spiralOrder(int[][] matrix) { List result = new ArrayList(); if (matrix == null || matrix.length == 0 || matrix[0] == null) {原创 2015-08-17 14:46:26 · 226 阅读 · 0 评论 -
Leetcode#53||Maximum Subarray
public class Solution { public int maxSubArray(int[] nums) { if (nums == null || nums.length == 0) { return 0; } int length = nums.length;原创 2015-08-17 10:21:32 · 210 阅读 · 0 评论 -
Leetcode#48||Rotate Image
public class Solution { public void rotate(int[][] matrix) { if (matrix == null || matrix.length == 0 || matrix[0].length == 0) { return; } int length原创 2015-08-17 09:49:09 · 216 阅读 · 0 评论 -
Leetcode#34||Search for a Range
public class Solution { public int[] searchRange(int[] nums, int target) { int[] result = {-1, -1}; if (nums == null || nums.length < 1) { return result;原创 2015-08-14 17:18:50 · 274 阅读 · 0 评论 -
Leetcode#42||Trapping Rain Water
public class Solution { public int trap(int[] height) { if (height == null || height.length < 3) { return 0; } int result = 0; int maxHeightInd原创 2015-08-15 09:09:25 · 213 阅读 · 0 评论 -
Leetcode#56||Merger Intervals
/** * Definition for an interval. * public class Interval { * int start; * int end; * Interval() { start = 0; end = 0; } * Interval(int s, int e) { start = s; end = e; } * } */原创 2015-08-17 15:09:16 · 227 阅读 · 0 评论 -
Leetcode#62||Unique Paths
public class Solution { public int uniquePaths(int m, int n) { if (m < 1 || n < 1) { return 0; } int[] paths = new int[n]; for (int j原创 2015-08-18 11:13:34 · 299 阅读 · 0 评论 -
Largest Rectangle in Histogram
public class Solution { public int largestRectangleArea(int[] height) { if (height == null || height.length == 0) { return 0; } Stack s = new Stack();原创 2015-08-07 10:07:27 · 301 阅读 · 0 评论 -
Leetcode#74||Search a 2D Matrix
public class Solution { public boolean searchMatrix(int[][] matrix, int target) { if (matrix == null || matrix.length == 0 || matrix[0].length == 0) { return false; }原创 2015-08-19 07:55:22 · 324 阅读 · 0 评论 -
Maximal Rectangle
public class Solution { public int maximalRectangle(char[][] matrix) { if (matrix == null || matrix.length == 0 || matrix[0].length == 0) { return 0; } int row原创 2015-08-07 10:34:16 · 338 阅读 · 0 评论 -
Leetcode#73||Set Matrix Zeroes
public class Solution { public void setZeroes(int[][] matrix) { if (matrix == null || matrix.length == 0 || matrix[0].length == 0) { return; } int row原创 2015-08-18 18:17:18 · 431 阅读 · 0 评论 -
Best Time to Buy and Sell Stock IV
Out of Memory Errorpublic class Solution { public int maxProfit(int k, int[] prices) { if (prices == null || prices.length < 2 || k < 1) { return 0; } int le原创 2015-08-06 13:42:41 · 287 阅读 · 0 评论 -
Leetcode#66||Plus One
public class Solution { public int[] plusOne(int[] digits) { if (digits == null || digits.length == 0) { return digits; } int carry = 1;原创 2015-08-18 14:54:28 · 279 阅读 · 0 评论 -
Leetcode#64||Minimum Path Sum
public class Solution { public int minPathSum(int[][] grid) { if (grid == null || grid.length == 0 || grid[0].length == 0) { return -1; } int m = grid.原创 2015-08-18 11:32:37 · 267 阅读 · 0 评论 -
Leetcode#63||Unique Paths II
public class Solution { public int uniquePathsWithObstacles(int[][] obstacleGrid) { if (obstacleGrid == null || obstacleGrid.length == 0 || obstacleGrid[0].length ==0) { return原创 2015-08-18 11:23:30 · 233 阅读 · 0 评论 -
Leetcode#31||Next Permutation
public class Solution { public void nextPermutation(int[] nums) { if (nums == null || nums.length <= 1) { return; } int left = 0; for (int i =原创 2015-08-14 16:11:44 · 213 阅读 · 0 评论 -
Leetcode#41||First Missing Positive
public class Solution { public int firstMissingPositive(int[] nums) { if (nums == null || nums.length == 0) { return 1; } int length = nums.length;原创 2015-08-15 08:57:14 · 229 阅读 · 0 评论 -
Maximal Square
利用滚动矩阵节省内存。public class Solution { public int maximalSquare(char[][] matrix) { if (matrix == null || matrix.length == 0 || matrix[0].length == 0) { return 0; }原创 2015-07-31 10:57:26 · 209 阅读 · 0 评论 -
Maximum Subarray
public class Solution { public int maxSubArray(int[] nums) { if (nums == null) { return -1; } int result = Integer.MIN_VALUE; int sum = 0;原创 2015-07-29 15:31:52 · 208 阅读 · 0 评论 -
Leetcode#1||Two Sum
public class Solution { public int[] twoSum(int[] nums, int target) { if (nums == null || nums.length < 2) { return null; } Map map = new HashMap();原创 2015-08-11 09:11:57 · 211 阅读 · 0 评论 -
Leetcode#11||Container With Most Water
public class Solution { public int maxArea(int[] height) { if (height == null || height.length < 2) { return 0; } int left = 0; int right = hei原创 2015-08-11 15:07:22 · 215 阅读 · 0 评论 -
Leetcode#4||Median of Two Sorted Arrays
public class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { int len1 = nums1.length; int len2 = nums2.length; if ((len1 + len2) % 2 ==原创 2015-08-11 10:44:40 · 223 阅读 · 0 评论 -
Unique Paths
public class Solution { public int uniquePaths(int m, int n) { if (m < n) { int temp = m; m = n; n = temp; } int[] path = new i原创 2015-07-30 07:46:53 · 218 阅读 · 0 评论 -
Unique Path II
同Leetcode No.64 Minimum Path一样,可以使用滚动矩阵,来减小Space Complexity。public class Solution { public int uniquePathsWithObstacles(int[][] obstacleGrid) { if (obstacleGrid == null || obstacleGrid.l原创 2015-07-29 16:14:43 · 322 阅读 · 0 评论 -
Minimum Path Sum
public class Solution { public int minPathSum(int[][] grid) { if (grid == null || grid.length == 0 || grid[0].length == 0) { return -1; } int row = gri原创 2015-07-29 15:53:41 · 239 阅读 · 0 评论 -
Leetcode#27||Remove Element
public class Solution { public int removeElement(int[] nums, int val) { if (nums == null || nums.length == 0) { return 0; } int cnt = 0;原创 2015-08-12 17:18:22 · 215 阅读 · 0 评论 -
Leetcode#18||4 Sum
public class Solution { public List> fourSum(int[] nums, int target) { List> result = new ArrayList>(); if (nums == null || nums.length < 3) { return result;原创 2015-08-12 12:09:00 · 201 阅读 · 0 评论 -
Leetcode#45||Jump Game II
public class Solution { public int jump(int[] nums) { if (nums == null || nums.length == 0) { return 0; } int left = 0; int right = 0;原创 2015-08-15 17:37:21 · 243 阅读 · 0 评论 -
Leetcode#33||Search in Rotated Sorted Array
public class Solution { public int search(int[] nums, int target) { if (nums == null || nums.length < 1) { return -1; } int length = nums.length;原创 2015-08-14 17:18:03 · 221 阅读 · 0 评论 -
Leetcode#35||Search Insert Position
public class Solution { public int searchInsert(int[] nums, int target) { if (nums == null || nums.length < 1) { return -1; } int length = nums.length;原创 2015-08-14 18:04:23 · 213 阅读 · 0 评论 -
Maximum Product Subarray
DP + 滚动矩阵public class Solution { public int maxProduct(int[] nums) { if (nums == null || nums.length == 0) { return -1; } int result = nums[0];原创 2015-08-01 13:50:14 · 203 阅读 · 0 评论 -
Triangle
DP问题 + 滚动数组public class Solution { public int minimumTotal(List> triangle) { if (triangle == null || triangle.size() == 0) { return -1; } int length原创 2015-08-01 09:07:04 · 286 阅读 · 0 评论 -
Leetcode#15||3 Sum
public class Solution { public List> threeSum(int[] nums) { List> result = new ArrayList>(); if (nums == null || nums.length < 3) { return result; }原创 2015-08-12 10:53:55 · 207 阅读 · 0 评论 -
Leetcode#26||Remove Duplicates from Sorted Array
public class Solution { public int removeDuplicates(int[] nums) { if (nums.length <= 1) { return nums.length; } int cnt = 0; for (int原创 2015-08-12 17:13:12 · 205 阅读 · 0 评论 -
Leetcode#16||3 Sum Closest
public class Solution { public int threeSumClosest(int[] nums, int target) { if (nums == null || nums.length < 3) { return -1; } int min = Integer.MAX_原创 2015-08-12 11:01:51 · 218 阅读 · 0 评论 -
Leetcode#75||Sort Colors
public class Solution { public void sortColors(int[] nums) { if (nums == null || nums.length < 2) { return; } int length = nums.length;原创 2015-08-19 14:03:30 · 312 阅读 · 0 评论