Commit 262273b

authored

LeetCode Daily Problem 11th October 2022

-Added Java Solution -Added C++ Solution

1 parent 7a3115f commit 262273bCopy full SHA for 262273b

File tree

+38

-0

lines changed

+38

-0

lines changed

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,22 @@`
	`1`	`+public class Solution {`
	`2`	`+ public boolean increasingTriplet(int[] nums) {`
	`3`	`+ if (nums == null \|\| nums.length < 3 ){`
	`4`	`+ return false;`
	`5`	`+ }`
	`6`	`+ int min = Integer.MAX_VALUE;`
	`7`	`+ int secondMin = Integer.MAX_VALUE;`
	`8`	`+`
	`9`	`+ for (int i = 0; i < nums.length; i++){`
	`10`	`+ if (nums[i] <= min){`
	`11`	`+ min = nums[i];`
	`12`	`+ }`
	`13`	`+ else if (nums[i] <= secondMin){`
	`14`	`+ secondMin = nums[i];`
	`15`	`+ }`
	`16`	`+ else {`
	`17`	`+ return true;`
	`18`	`+ }`
	`19`	`+ }`
	`20`	`+ return false;`
	`21`	`+ }`
	`22`	`+}`

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,16 @@`
	`1`	`+class Solution {`
	`2`	`+public:`
	`3`	`+ bool increasingTriplet(vector<int>& nums) {`
	`4`	`+ int a = INT_MAX;`
	`5`	`+ int b = INT_MAX;`
	`6`	`+`
	`7`	`+ int n = nums.size();`
	`8`	`+`
	`9`	`+ for(auto n:nums){`
	`10`	`+ if(n <= a)a = n;`
	`11`	`+ else if( n <= b)b = n;`
	`12`	`+ else return true;`
	`13`	`+ }`
	`14`	`+ return false;`
	`15`	`+ }`
	`16`	`+};`

Comments

(0)