Commit 6d113dd

committed

Day 1 Solutions

0 parents commit 6d113ddCopy full SHA for 6d113dd

File tree

+28

-0

lines changed

+28

-0

lines changed

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+class Solution {`
	`2`	`+public:`
	`3`	`+ bool containsDuplicate(vector<int>& nums) {`
	`4`	`+ int n= nums.size();`
	`5`	`+ sort(nums.begin(), nums.end());`
	`6`	`+ for(int i=0;i<n-1;i++){`
	`7`	`+ if(nums[i]==nums[i+1]){`
	`8`	`+ return true;`
	`9`	`+ }`
	`10`	`+ }`
	`11`	`+ return false;`
	`12`	`+ }`
	`13`	`+};`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+class Solution {`
	`2`	`+public:`
	`3`	`+ int maxSubArray(vector<int>& nums) {`
	`4`	`+ if(nums.size()==0){`
	`5`	`+ return 0;`
	`6`	`+ }`
	`7`	`+ int maxSum=nums[0];`
	`8`	`+ int currSum=nums[0];`
	`9`	`+ for(int i=1; i<nums.size(); i++){`
	`10`	`+ currSum= max(nums[i], currSum+nums[i]);`
	`11`	`+ maxSum= max(maxSum,currSum);`
	`12`	`+ }`
	`13`	`+ return maxSum;`
	`14`	`+ }`
	`15`	`+};`

Comments

(0)