weixin_39979073的博客

今天本来想做三道题目，无奈拖延症效率太低。。。Description：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 significant digit is at th...

今日份leetcode 26. Remove Duplicates from Sorted ArrayDescription:Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.Do not ...

Description:Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of...

因为一些事情已经有两天没刷leetcode了，从今天开始加油！一切都会慢慢变好的。今日份leetcode 11. Container With Most WaterDescription:Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n...

昨天偷了个懒没有刷leetcode题目。懊悔不已。。。今日份leetcode 27. Remove ElementDescription:Given an array nums and a value val, remove all instances of that value in-place and return the new length.Do not allocate e...

今日份leetcode 88. Merge Sorted ArrayDescription:Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:The number of elements initialized in nums1 and nums...

今日份leetcode 189. Rotate ArrayDescription:Given an array, rotate the array to the right by k steps, where k is non-negative.Example 1:Input: [1,2,3,4,5,6,7] and k = 3Output: [5,6,7,1,2,3,4]Expl...

这是今天的第二道题目，本来计划好的做三道，终究还是效率低。。。Description:Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoS...

Description:Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal’s triangle.Note that the row index starts from 0.In Pascal’s triangle, each number is the sum of the t...

283.Move ZeroesDescription:Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.Example:Input: [0,1,0,3,12]Output: ...

今天是第一次刷leetcode的题目，刚开始接触有些困难。从今天开始每天至少一题（有时间就写笔记）。希望坚持下去，加油！版本一class Solution { public int searchInsert(int[] nums, int target) { int flag=-1; if(nums.length==1){ if(...

今日份LeetCode 16. 3Sum ClosestDescription:Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three in...