Leetcode-Divide and Conquer
Huangyanxl
这个作者很懒,什么都没留下…
展开
-
Leetcode 169 Majority Element
class Solution {public: int majorityElement(vector& nums) { int majEle; int count = 0; for(int i = 0; i if(count == 0) { majEle = nums[i]; count++;原创 2017-04-04 12:44:33 · 416 阅读 · 0 评论 -
Leetcode 53 Maximum Subarray
class Solution {public: int maxSubArray(vector& nums) { int maxSub1 = nums[0] + nums[1]; int maxSub2 = nums[0]; int both; int s1, s2; int add; for(int i = 0;原创 2017-03-13 20:36:27 · 207 阅读 · 0 评论