SingularPoint01的博客

Lintcode52 Next Permutation solution 题解

【题目描述】Given a list of integers, which denote a permutation.Find the next permutation in ascending order.Notice:The list may contains duplicate integers.给定一个整数数组来表示排列，找出其之后的一个排列。注意:排列中可能包含重复的整数【题目链接】ww

题解

转载 2017-07-31 20:55:21 660 阅读

Lintcode51 Previous Permutation solution 题解

【题目描述】Given a list of integers, which denote a permutation.Find the previous permutation in ascending order.Notice:The list may contains duplicate integers.给定一个整数数组来表示排列，找出其上一个排列。注意：排列中可能包含重复的整数【题目链接】

题解

转载 2017-07-31 20:55:15 412 阅读

Lintcode50 Product of Array Exclude Itself solution 题解

【题目描述】Given an integers array A.Define B[i] = A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1], calculate B WITHOUT divide operation.给定一个整数数组A。定义B[i] = A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1]，计算B的时候请不

题解

转载 2017-07-29 00:49:58 607 阅读

Lintcode49 Sort Letters by Case solution 题解

【题目描述】Given a string which contains only letters. Sort it by lower case first and upper case second.Notice:It's NOT necessary to keep the original order of lower-case letters and upper case letters.给定

题解

转载 2017-07-28 23:48:19 495 阅读

Lintcode48 Majority Number III solution 题解

【题目描述】Given an array of integers and a number k, the majority number is the number that occurs more than 1/k of the size of the array.Find it.Notice:There is only one majority number in the array.给定一个

算法

转载 2017-07-25 13:35:11 427 阅读

程序员常用的刷题网站

1、LintcodeLintcode.com——LintCode网站是国内较大的在线编程&测评网站。此网站提供各大IT公司的算法面试题类型，行分门别类，由简单到中等，再到难，便于不同水平的程序员进行刷题练习。同时网站支持多种语言（Java, Python, C++），方便不同语言特长的程序员利用擅长语言进行刷题练习。因此对于不同编程能力水平、不同职位需求的人来说都是非常有用的刷题网站。[注

刷题

转载 2017-07-24 13:31:36 3209 阅读 1收藏

Lintcode47 Majority Number II solution 题解

【题目描述】Given an array of integers, the majority number is the number that occurs more than 1/3 of the size of the array.Find it.Notice:There is only one majority number in the array.给定一个整型数组，找到主元素，它在数组

算法

转载 2017-07-24 00:12:44 399 阅读

Lintcode46 Majority Number solution 题解

【题目描述】Given an array of integers, the majority number is the number that occurs more than half of the size of the array. Find it.Notice：You may assume that the array is non-empty and the majority numb

算法

转载 2017-07-23 23:57:02 385 阅读

Lintcode45 Maximum Subarray Difference solution 题解

【题目描述】Given an array with integers.Find two non-overlapping subarrays A and B, which |SUM(A) - SUM(B)| is the largest.Return the largest difference.Notice:The subarray should contain at least one numb

算法

转载 2017-07-21 08:15:33 561 阅读

Lintcode44 Minimum Subarray solution 题解

【题目描述】Given an array of integers, find the subarray with smallest sum.Return the sum of the subarray.Notice:The subarray should contain one integer at least.给定一个整数数组，找到一个具有最小和的子数组。返回其最小和。注意：子数组最少包含一个数

算法

转载 2017-07-21 08:13:27 648 阅读

Lintcode43 Maximum Subarray III solution 题解

【题目描述】Given an array of integers and a number k, find k non-overlapping subarrays which have the largest sum.The number in each subarray should be contiguous.Return the largest sum.Notice:The subarray

算法

转载 2017-07-19 09:57:24 617 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

13135565