Skip to content

LCM #212

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
mtarek97 wants to merge 5 commits into from
Closed

LCM #212

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
258cc34
Create LCM.java
mtarek97 Oct 16, 2017
ab1f020
Update LCM.java
mtarek97 Oct 16, 2017
3b1f92f
add Max1DRangeSum (DP)
mtarek97 Oct 17, 2017
dbb172a
Delete Max1DRangeSum.java
mtarek97 Oct 28, 2017
c36027e
Create Max1DRangeSum.java
mtarek97 Oct 28, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
25 changes: 25 additions & 0 deletions Dynamic Programming/Max1DRangeSum.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@

public class Max1DRangeSum {

public static int getMax1DRangeSum(int n, int A[]){
int current_sum = 0, ans = 0;
for (int i = 0; i < n; i++)
{
if (current_sum + A[i] >= 0) {
current_sum += A[i];
ans = Math.max(ans, current_sum);
}
else {
current_sum = 0;
}
}
return ans;
}

public static void main(String[] args) {

int n = 9, A[] = { 4, -5, 4, -3, 4, 4, -4, 4, -5 };
System.out.println(getMax1DRangeSum(n, A)); // should be 9
}

}
15 changes: 15 additions & 0 deletions Others/LCM.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
// Finding Lowest Common Multiple of Two Integers

public class LCM {

public static int lcm(int a, int b) {
return a*b/gcd(a,b);
}

private static int gcd(int a, int b) {
if(b==0) {
return a;
}
return gcd(b,a%b);
}
}