Skip to content

Instantly share code, notes, and snippets.

@DoctorKittens
Last active November 28, 2017 22:29
Show Gist options
  • Save DoctorKittens/f2a1a2886445c9d9b753a4bac92276bb to your computer and use it in GitHub Desktop.
Save DoctorKittens/f2a1a2886445c9d9b753a4bac92276bb to your computer and use it in GitHub Desktop.
Phone book, first try
import java.util.Scanner;
public class Add implements Comparable<Add>{
private String name;
private String lastName;
private int number;
public Add(String name, String lastName, int number) {
this.name = name;
this.lastName = lastName;
this.number = number;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getLastName() {
return lastName;
}
public void setLastName(String lastName) {
this.lastName = lastName;
}
public int getNumber() {
return number;
}
public void setNumber(int number) {
this.number = number;
}
@Override
public String toString() {
return "Imię: " + name + '\'' +
", Nazwisko = " + lastName + '\'' +
", Numer telefonu: " + number +
'}';
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Add add = (Add) o;
if (number != add.number) return false;
if (name != null ? !name.equals(add.name) : add.name != null) return false;
return lastName != null ? lastName.equals(add.lastName) : add.lastName == null;
}
@Override
public int hashCode() {
int result = name != null ? name.hashCode() : 0;
result = 31 * result + (lastName != null ? lastName.hashCode() : 0);
result = 31 * result + number;
return result;
}
@Override
public int compareTo(Add o) {
if (number == o.getNumber()){
return 0 ;
} else if (number > o.getNumber()){
return 1;
}
return -1;
}
}
import java.util.ArrayList;
import java.util.InputMismatchException;
import java.util.Scanner;
public class List {
ArrayList<Add> book = new ArrayList<>();
Scanner aX = new Scanner(System.in);
private String nameList;
private String lastNameList;
private int nrList;
public void addRekord () {
for (int i = 0; ; i++) {
System.out.println("Podaj imie:");
nameList = aX.nextLine();
System.out.println("Podaj nazwisko: ");
lastNameList = aX.nextLine();
Scanner aY = new Scanner(System.in);
try {
System.out.println("Podaj numer: ");
nrList = aY.nextInt();
} catch (InputMismatchException e) {
System.out.println("Znak nie jest cyrą, błąd! Powrót do menu!");
break;
}
book.add(i, new Add(nameList, lastNameList, nrList));
System.out.println("Numer został dodany");
break;
}
}
public void getList() {
for (Add x : book)
System.out.println(x);
}
public void printLastName(){
System.out.println("Podaj nazwisko: ");
String lName = aX.nextLine();
for (Add x : book){
if (lName.equals(x.getLastName())){
System.out.println(x);
break;
} else {
System.out.println("Nie ma takiego numeru");
break;
}
}
}
}
public class Main {
public static void main(String [] args){
Menu menuu = new Menu();
menuu.Menu();
}
}
public class Menu {
int numbers;
List listt = new List();
public void Menu() {
while (true) {
System.out.println("******************************************\n\tWitaj w menu książki telefonicznej\n\n******************************************\n1. Dodaj kontakt do książki\n2. Wyszukaj kontakt\n3. Wyświetl wszystkie kontakty\n 4.Zakończ program");
Scanner aY = new Scanner(System.in);
try {
System.out.println("Podaj index: ");
numbers = aY.nextInt();
} catch (InputMismatchException e) {
numbers = 0;
}
{
switch (numbers) {
case 1:
System.out.println("Dodaj do książki");
listt.addRekord();
break;
case 2:
System.out.println("Wyświetl kontakt");
listt.printLastName();
break;
case 3:
System.out.println("Wyświetl wszystkie kontakty");
listt.getList();
break;
case 4:
System.exit(0);
default:
System.out.println("Tej pozycji nie ma w menu");
break;
}
}
}
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment