Skip to content
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.

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

Test Case Added & Java File Changed For BiggestNumber Problem #8

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
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
60 changes: 30 additions & 30 deletions src/main/java/org/jugbd/marathon/day3/TrappingTheRainWater.java
Original file line number Diff line number Diff line change
Expand Up @@ -2,34 +2,34 @@


public class TrappingTheRainWater {
static int findWaterUnit(int[] arr) {
int unitOfWater = 0, i, j, k;
boolean checked[] = new boolean[arr.length];
for(i=0;i<arr.length;i++) {
checked[i] = false;
}
for(i=0;i<arr.length;i++) {
if(checked[i] == false) {
for(j=i+1;j<arr.length;j++) {
if(arr[i] <= arr[j] && checked[j] == false) {
for(k=i+1;k<j;k++) {
unitOfWater += (arr[i]-arr[k]);
checked[k] = true;
}
break;
}
}
}
}
return unitOfWater;
}
static int findWaterUnit(int[] arr) {

int unitOfWater = 0, i, j, k;
boolean checked[] = new boolean[arr.length];

for(i=0;i<arr.length;i++) {

checked[i] = false;
}

for(i=0;i<arr.length;i++) {

if(checked[i] == false) {

for(j=i+1;j<arr.length;j++) {

if(arr[i] <= arr[j] && checked[j] == false) {

for(k=i+1;k<j;k++) {

unitOfWater += (arr[i]-arr[k]);
checked[k] = true;
}
break;
}
}
}
}
return unitOfWater;
}
}
38 changes: 35 additions & 3 deletions src/main/java/org/jugbd/marathon/day4/Directory.java
Original file line number Diff line number Diff line change
@@ -1,29 +1,61 @@
package org.jugbd.marathon.day4;

import java.util.Date;
import java.util.ArrayList;

public class Directory {
private String name;

private String name;
private Date createdDate;
private ArrayList<Directory> directoryList;
private ArrayList<File> fileList;

public Directory(String root) {

this.name = root;
this.createdDate = new Date();
this.directoryList = new ArrayList<>();
this.fileList = new ArrayList<>();
}

public void add(Directory directory) {

this.directoryList.add(directory);
}

public void add(File file) {

this.fileList.add(file);
}

public int getAllFileCounts(Directory dir) {

if(dir.directoryList.size() == 0)
return dir.fileList.size();

int length = dir.directoryList.size();
int sumOfFiles = 0;

for(int i = 0; i < length; i++) {

sumOfFiles += getAllFileCounts(dir.directoryList.get(i));
}
return sumOfFiles + dir.fileList.size();
}

public int numberOfFiles() {

return 0;
return getAllFileCounts(this);
}

public Object getName() {
public String getName() {

return name;
}

public Date getCreatedDate() {

return createdDate;
}

}
5 changes: 4 additions & 1 deletion src/main/java/org/jugbd/marathon/day4/File.java
Original file line number Diff line number Diff line change
Expand Up @@ -2,13 +2,16 @@


public class File {
private String name;

private String name;

public File(String name) {

this.name = name;
}

public String getName() {

return name;
}
}
Original file line number Diff line number Diff line change
Expand Up @@ -16,6 +16,6 @@ public void basicTests() {
assertEquals(414, BiggestNumber.findTheNextBiggerNumber(144));
assertEquals(-1, BiggestNumber.findTheNextBiggerNumber(111));
assertEquals(-1, BiggestNumber.findTheNextBiggerNumber(531));
assertEquals(753772, BiggestNumber.findTheNextBiggerNumber(737752));
assertEquals(752377, BiggestNumber.findTheNextBiggerNumber(737752));
}
}