LeetCode
yyliunianyy
这个作者很懒,什么都没留下…
展开
-
LeetCode题库 第6题 Z字形变换
字符串:PAYPALISHIRING,4行展示的"Z"字形图案为输出为:PINALSIGYAHRPIchar* convert(char* s, int numRows) { if (numRows == 1) return s; int i = 0, j = 0, span, span1 = 0, span2 = 0, k = 0, sPos = 0, flag = 1; int ...原创 2018-04-14 15:51:08 · 266 阅读 · 0 评论 -
LeetCode(Python版)——118. Pascal's Triangle
Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.In Pascal's triangle, each number is the sum of the two numbers directly above it.Example: Input: 5 ...原创 2018-08-03 09:23:02 · 437 阅读 · 0 评论 -
LeetCode(Python版)——88. Merge Sorted Array
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 nums2 are m and n respectively. You may assume tha...原创 2018-08-03 09:04:14 · 285 阅读 · 0 评论 -
LeetCode(Python版)——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 significant digit is at the head of the list, and each element...原创 2018-08-01 20:14:45 · 189 阅读 · 0 评论 -
LeetCode(Python版)——53. Maximum Subarray
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.Example: Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 ...原创 2018-08-01 19:47:03 · 810 阅读 · 0 评论 -
LeetCode(Python版)——121. Best Time to Buy and Sell Stock
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 the stock),...原创 2018-08-10 10:08:43 · 722 阅读 · 0 评论 -
LeetCode(Python版)——1. Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the same ...原创 2018-07-28 09:23:38 · 134 阅读 · 0 评论 -
LeetCode(Python版)——27. Remove Element
Given an array nums and a value val, remove all instances of that value in-place and return the new length.Do not allocate extra space for another array, you must do this by modifying the input arra...原创 2018-07-31 09:31:55 · 207 阅读 · 0 评论 -
LeetCode(Python版)——26. Remove Duplicates from Sorted Array
Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this by modifyi...原创 2018-07-31 09:16:52 · 418 阅读 · 0 评论 -
LeetCode(Python版)——119. Pascal's Triangle II
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 two numbers ...原创 2018-08-03 10:20:25 · 305 阅读 · 0 评论