03 2019 档案

摘要:缺角效果 I have a nice idea 阅读全文
posted @ 2019-03-28 00:04 mingL 阅读(174) 评论(0) 推荐(0) 编辑
摘要:内圆角 I have a nice idea 阅读全文
posted @ 2019-03-27 23:44 mingL 阅读(132) 评论(0) 推荐(0) 编辑
摘要:82. Remove Duplicates from Sorted List II Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from 阅读全文
posted @ 2019-03-22 23:19 mingL 阅读(92) 评论(0) 推荐(0) 编辑
摘要:81. Search in Rotated Sorted Array II Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,0,1,2,2 阅读全文
posted @ 2019-03-22 22:49 mingL 阅读(66) 评论(0) 推荐(0) 编辑
摘要:80. Remove Duplicates from Sorted Array II Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and r 阅读全文
posted @ 2019-03-22 22:39 mingL 阅读(82) 评论(0) 推荐(0) 编辑
摘要:79. Word Search Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent ce 阅读全文
posted @ 2019-03-20 22:14 mingL 阅读(112) 评论(0) 推荐(0) 编辑
摘要:78. Subsets Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate sub 阅读全文
posted @ 2019-03-20 22:09 mingL 阅读(158) 评论(0) 推荐(0) 编辑
摘要:77. Combinations Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. Example: 阅读全文
posted @ 2019-03-20 21:56 mingL 阅读(157) 评论(0) 推荐(0) 编辑
摘要:76. Minimum Window Substring Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O( 阅读全文
posted @ 2019-03-20 21:49 mingL 阅读(160) 评论(0) 推荐(0) 编辑
摘要:75. Sort Colors Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the 阅读全文
posted @ 2019-03-20 21:39 mingL 阅读(193) 评论(0) 推荐(0) 编辑
摘要:74. Search a 2D Matrix Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers i 阅读全文
posted @ 2019-03-20 21:33 mingL 阅读(120) 评论(0) 推荐(0) 编辑
摘要:73. Set Matrix Zeroes Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place. Example 1: Example 2: 阅读全文
posted @ 2019-03-16 23:08 mingL 阅读(123) 评论(0) 推荐(0) 编辑
摘要:72. Edit Distance Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the following 3 阅读全文
posted @ 2019-03-15 23:41 mingL 阅读(107) 评论(0) 推荐(0) 编辑
摘要:71. Simplify Path Given an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path. In a UNIX-style fi 阅读全文
posted @ 2019-03-15 23:37 mingL 阅读(349) 评论(0) 推荐(0) 编辑
摘要:70. Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many dist 阅读全文
posted @ 2019-03-11 20:29 mingL 阅读(197) 评论(0) 推荐(0) 编辑
摘要:69. Sqrt(x) Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the return t 阅读全文
posted @ 2019-03-11 20:26 mingL 阅读(178) 评论(0) 推荐(0) 编辑
摘要:68. Text Justification Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully 阅读全文
posted @ 2019-03-11 20:25 mingL 阅读(155) 评论(0) 推荐(0) 编辑
摘要:67. Add Binary Given two binary strings, return their sum (also a binary string). The input strings are both non-empty and contains only characters 1  阅读全文
posted @ 2019-03-11 20:12 mingL 阅读(173) 评论(0) 推荐(0) 编辑
摘要:66. Plus One Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most 阅读全文
posted @ 2019-03-11 20:06 mingL 阅读(289) 评论(0) 推荐(0) 编辑
摘要:65. Valid Number Validate if a given string can be interpreted as a decimal number. Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => fal 阅读全文
posted @ 2019-03-11 19:47 mingL 阅读(119) 评论(0) 推荐(0) 编辑
摘要:64. Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all num 阅读全文
posted @ 2019-03-11 19:42 mingL 阅读(121) 评论(0) 推荐(0) 编辑
摘要:63. Unique Paths II A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either do 阅读全文
posted @ 2019-03-08 00:06 mingL 阅读(88) 评论(0) 推荐(0) 编辑
摘要:62. Unique Paths Share Share A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move 阅读全文
posted @ 2019-03-08 00:03 mingL 阅读(155) 评论(0) 推荐(0) 编辑
摘要:61. Rotate List Given a linked list, rotate the list to the right by k places, where k is non-negative. Example 1: Example 2: 阅读全文
posted @ 2019-03-03 19:17 mingL 阅读(144) 评论(0) 推荐(0) 编辑
摘要:let obj={ 'a':'a', 'b':null, 'c':'c' } var removePropertyOfNull=function(obj){ Object.keys(obj).forEach(item=>{ if(!obj[item]) delete obj[item] }) return obj; } remo... 阅读全文
posted @ 2019-03-02 22:15 mingL 阅读(6404) 评论(0) 推荐(1) 编辑
摘要:60. Permutation Sequence The set [1,2,3,...,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, w 阅读全文
posted @ 2019-03-01 20:17 mingL 阅读(176) 评论(0) 推荐(0) 编辑
摘要:59. Spiral Matrix II Given a positive integer n, generate a square matrix filled with elements from 1 to n2in spiral order. Example: 阅读全文
posted @ 2019-03-01 20:15 mingL 阅读(98) 评论(0) 推荐(0) 编辑
摘要:58. Length of Last Word Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the 阅读全文
posted @ 2019-03-01 20:13 mingL 阅读(107) 评论(0) 推荐(0) 编辑
摘要:57. Insert Interval Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the i 阅读全文
posted @ 2019-03-01 20:11 mingL 阅读(116) 评论(0) 推荐(0) 编辑
摘要:56. Merge Intervals Given a collection of intervals, merge all overlapping intervals. Example 1: Example 2: 阅读全文
posted @ 2019-03-01 20:07 mingL 阅读(335) 评论(0) 推荐(0) 编辑
摘要:55. Jump Game Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represe 阅读全文
posted @ 2019-03-01 20:04 mingL 阅读(207) 评论(0) 推荐(0) 编辑
摘要:54. Spiral Matrix Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. Example 1: Example 2: 阅读全文
posted @ 2019-03-01 20:00 mingL 阅读(138) 评论(0) 推荐(0) 编辑
摘要:53. Maximum Subarray Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return i 阅读全文
posted @ 2019-03-01 19:54 mingL 阅读(226) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示