Commit b328bbd

committed

LC#1502 checks if we can make AP series from given set of numbers in array

1 parent daee90d commit b328bbdCopy full SHA for b328bbd

File tree

+32

-0

lines changed

Leetcode/Study Plan/ProgrammingSkills/Skills1/Day4
- CanMakeArithmeticProgressionFromSequence1502.java

+32

-0

lines changed

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+package LeetcodeBadge.ProgrammingSkills.Skills1.Day4;`
	`2`	`+`
	`3`	`+import java.util.Arrays;`
	`4`	`+`
	`5`	`+public class CanMakeArithmeticProgressionFromSequence1502 {`
	`6`	`+`
	`7`	`+ public static boolean canMakeArithmeticProgression(int[] arr) {`
	`8`	`+ if (arr.length < 2)`
	`9`	`+ return false;`
	`10`	`+`
	`11`	`+ Arrays.sort(arr);`
	`12`	`+ int diff = arr[0] - arr[1];`
	`13`	`+ for (int i = 1; i < arr.length - 1; i++) {`
	`14`	`+ int curr = arr[i];`
	`15`	`+ int next = arr[i + 1];`
	`16`	`+`
	`17`	`+ int currdiff = curr - next;`
	`18`	`+`
	`19`	`+ if (currdiff == diff)`
	`20`	`+ continue;`
	`21`	`+ else`
	`22`	`+ return false;`
	`23`	`+ }`
	`24`	`+`
	`25`	`+ return true;`
	`26`	`+ }`
	`27`	`+`
	`28`	`+ public static void main(String[] args) {`
	`29`	`+ System.out.println(canMakeArithmeticProgression(new int[] { 3, 5, 1 }));`
	`30`	`+ System.out.println(canMakeArithmeticProgression(new int[] { 1, 2, 4 }));`
	`31`	`+ }`
	`32`	`+}`

Comments

(0)