-
Notifications
You must be signed in to change notification settings - Fork 0
W2a2 #2
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
Open
phnsh
wants to merge
4
commits into
master
Choose a base branch
from
w2a2
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
W2a2 #2
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
Binary file not shown.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,15 @@ | ||
| public class Factorial_W2A1_3 { | ||
| static int product = 1; | ||
| public static void main(String args[]) { | ||
| int num = 4; | ||
| System.out.println(recursion(num)); | ||
| } | ||
|
|
||
| static int recursion(int num) { | ||
| if(num > 0) { | ||
| product = product * num; | ||
| recursion(num - 1); | ||
| } | ||
| return product; | ||
| } | ||
| } |
Binary file not shown.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,18 @@ | ||
| public class Fibonacci_W2A1_1 { | ||
| static int temp1 = 0, temp2 = 1, temp3 = 0; | ||
| public static void main(String arg[]) { | ||
| int num = 9; | ||
| System.out.print(temp1 + " " + temp2 + " "); | ||
| recursion(num); | ||
| } | ||
|
|
||
| static void recursion(int num) { | ||
| if(num > 0) { | ||
| temp3 = temp1 + temp2; | ||
| temp1 = temp2; | ||
| temp2 = temp3; | ||
| System.out.print(temp3 + " "); | ||
| recursion(num - 1); | ||
| } | ||
| } | ||
| } |
Binary file not shown.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,19 @@ | ||
| import java.util.Arrays; | ||
|
|
||
| public class Reverse_W2A1_4 { | ||
| static int[] arr = {3,4,6,7,9}; | ||
| static int[] reversedArray = new int[arr.length]; | ||
| static int counter = 0; | ||
| public static void main(String args[]) { | ||
| System.out.println(recursion(arr.length)); | ||
| } | ||
|
|
||
| static String recursion(int arrLength) { | ||
| if(arrLength > 0) { | ||
| reversedArray[counter] = arr[(arr.length - 1) - counter]; | ||
| counter++; | ||
| recursion(arrLength - 1); | ||
| } | ||
| return Arrays.toString(reversedArray); | ||
| } | ||
| } |
Binary file not shown.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,15 @@ | ||
| public class SumOFArray_W2A1_2 { | ||
| static int sum = 0, i = 0; | ||
| static int[] arr = {3,4,2,7,9}; | ||
| public static void main(String args[]) { | ||
| System.out.println(recursion(arr.length)); | ||
| } | ||
| static int recursion(int arrLength) { | ||
| if(arrLength > 0) { | ||
| sum += arr[i]; | ||
| i++; | ||
| recursion(arrLength - 1); | ||
| } | ||
| return sum; | ||
| } | ||
| } |
Binary file not shown.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,106 @@ | ||
| import java.util.Scanner; | ||
|
|
||
| public class PizzaShop_W2A2_1 { | ||
| private String[] crust = {"Thin Crust", "Cheese Burst", "Classic Pan"}; | ||
| private int crustOption; | ||
| private int[] crustPrice = {100, 200, 300}; | ||
|
|
||
| private String[] toppings = {"Corn", "Chicken", "Paneer", "Pineapple", "Pepperoni"}; | ||
| private int toppingsOption; | ||
| private int[] toppingsPrice = {100, 200, 300, 400, 500}; | ||
|
|
||
| private String[] sides = {"Coke", "Fries", "Wedges", "Nachos"}; | ||
| private int sidesOption; | ||
| private int[] sidesPrice = {100, 200, 300, 400}; | ||
|
|
||
| private int[] offerTypes = {20, 50}; | ||
| private int offerOption = 0; | ||
|
|
||
| private double price; | ||
| private double discount; | ||
| //crusttype, toppings, sides, offers, price | ||
|
|
||
| public void getPrice() { | ||
| price = crustPrice[crustOption] + toppingsPrice[toppingsOption] + sidesPrice[sidesOption]; | ||
| if(offerOption > 0) { | ||
| discount = offerTypes[offerOption - 1] / 100.00; | ||
| discount = price * discount; | ||
| price = price - discount; | ||
| } | ||
| System.out.println("Total: Rs " + price); | ||
| } | ||
|
|
||
| public void setOffer(int option) { | ||
| offerOption = option; | ||
| } | ||
|
|
||
| public void getOffer() { | ||
| for(int i = 0; i < offerTypes.length; i++) { | ||
| System.out.print((i + 1) + " " + offerTypes[i] + "% Off\n"); | ||
| } | ||
| } | ||
|
|
||
| public void setSides(int option) { | ||
| sidesOption = option - 1; | ||
| } | ||
|
|
||
| public void getSides() { | ||
| for(int i = 0; i < sides.length; i++) { | ||
| System.out.print((i + 1) + " " + sides[i] + " Rs " + sidesPrice[i] + "\n"); | ||
| } | ||
| } | ||
|
|
||
| public void setToppings(int option) { | ||
| toppingsOption = option - 1; | ||
| } | ||
|
|
||
| public void getToppings() { | ||
| for(int i = 0; i < toppings.length; i++) { | ||
| System.out.print((i + 1) + " " + toppings[i] + " Rs " + toppingsPrice[i] + "\n"); | ||
| } | ||
| } | ||
|
|
||
| public void setCrust(int option) { | ||
| crustOption = option - 1; | ||
| } | ||
|
|
||
| public void getCrust() { | ||
| for(int i = 0; i < crust.length; i++) { | ||
| System.out.print((i + 1) + " " + crust[i] + " Rs " + crustPrice[i] + "\n"); | ||
| } | ||
| } | ||
|
|
||
| public static void main(String args[]) { | ||
| Scanner scans = new Scanner(System.in); | ||
| PizzaShop_W2A2_1 pizzaShop = new PizzaShop_W2A2_1(); | ||
| int option; | ||
| String offerGiven; | ||
| System.out.println("Select from below"); | ||
|
|
||
| System.out.println("Crust:"); | ||
| pizzaShop.getCrust(); | ||
| option = scans.nextInt(); | ||
| pizzaShop.setCrust(option); | ||
|
|
||
| System.out.println("Toppings: "); | ||
| pizzaShop.getToppings(); | ||
| option = scans.nextInt(); | ||
| pizzaShop.setToppings(option); | ||
|
|
||
| System.out.println("Sides: "); | ||
| pizzaShop.getSides(); | ||
| option = scans.nextInt(); | ||
| pizzaShop.setSides(option); | ||
|
|
||
| System.out.println("Any discounts to be applied?\ny/n"); | ||
| offerGiven = scans.next(); | ||
| if(offerGiven.equals("y")) { | ||
| System.out.println("Offers: "); | ||
| pizzaShop.getOffer(); | ||
| option = scans.nextInt(); | ||
| pizzaShop.setOffer(option); | ||
| } | ||
| pizzaShop.getPrice(); | ||
| scans.close(); | ||
| } | ||
| } | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,54 @@ | ||
| public class PizzaShop_W2A2_1_v2 { | ||
| private String crustType; | ||
| private String toppingType; | ||
| private String sidesType; | ||
| private int offers; | ||
| private boolean offerApplied = false; | ||
| private double price; | ||
| private double discount; | ||
|
|
||
| private int crustTypeAmount; | ||
| //crusttype, toppings, sides, offers, price | ||
| PizzaShop_W2A2_1_v2(String crust, String topping, String sides) { | ||
| crustType = crust; | ||
| toppingType = topping; | ||
| sidesType = sides; | ||
| } | ||
|
|
||
| PizzaShop_W2A2_1_v2(String crust, String topping, String sides, int offer) { | ||
| crustType = crust; | ||
| toppingType = topping; | ||
| sidesType = sides; | ||
| offers = offer; | ||
| offerApplied = true; | ||
| } | ||
|
|
||
| // private int getCrustPrice() { | ||
| // switch(crustType) { | ||
| // case "thinCrust": | ||
| // crustTypeAmount = 100; | ||
| // break; | ||
| // case "cheeseBurst": | ||
| // crustTypeAmount = 200; | ||
| // break; | ||
| // case "classicPan": | ||
| // crustTypeAmount = 300; | ||
| // break; | ||
| // } | ||
| // } | ||
|
|
||
| public double calculateTotalPrice() { | ||
| //logic to calculate price here | ||
| return price; | ||
| } | ||
| public static void main(String arg[]) { | ||
| //(crustType, toppingType, sidesType) | ||
| PizzaShop_W2A2_1_v2 pizzaWithoutOffer = new PizzaShop_W2A2_1_v2("Thin Crust", "Corn", "Fries"); | ||
| System.out.println("Total price: " + pizzaWithoutOffer.calculateTotalPrice()); | ||
|
|
||
| //20% off applied | ||
| //(crustType, toppingType, sidesType, offerDiscount) | ||
| PizzaShop_W2A2_1_v2 pizzaWithOfferApplied = new PizzaShop_W2A2_1_v2("Thin Crust", "Cheese Burst", "Classic Pan", 20); | ||
| System.out.println("Total price: " + pizzaWithOfferApplied.calculateTotalPrice()); | ||
| } | ||
| } |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Program is great but you need to put the main function in a different class than the Pizza class