mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-07 01:35:16 +08:00
fixed build error
This commit is contained in:
shellhub
@ -1,6 +1,9 @@
|
||||
package DataStructures.DynamicArray;
|
||||
|
||||
import java.util.*;
|
||||
import java.util.function.Consumer;
|
||||
import java.util.stream.Stream;
|
||||
import java.util.stream.StreamSupport;
|
||||
|
||||
/**
|
||||
* This class implements a dynamic array
|
||||
|
||||
@ -1,487 +0,0 @@
|
||||
package DataStructures.Graphs;
|
||||
/*
|
||||
Implementation of graph by using hashmap for vertices of class which contains hashmap for vertex and then algos like prims dijktsra ,depth for search and traversal ,breadth for search and traversal ,algo for cycle present or not ,connected or not ,if not connected then connect it
|
||||
Test case
|
||||
Graph gp=new Graph();
|
||||
gp.addVertex("A");
|
||||
gp.addVertex("B");
|
||||
gp.addVertex("C");
|
||||
gp.addVertex("D");
|
||||
gp.addVertex("E");
|
||||
gp.addVertex("F");
|
||||
gp.addVertex("G");
|
||||
gp.addEdge("A", "B", 2);
|
||||
gp.addEdge("A", "D", 10);
|
||||
gp.addEdge("B", "C", 3);
|
||||
gp.addEdge("C", "D", 1);
|
||||
gp.addEdge("D", "E", 8);
|
||||
gp.addEdge("E", "F", 5);
|
||||
gp.addEdge("E", "G", 6);
|
||||
gp.addEdge("F", "G", 4);
|
||||
|
||||
// gp.display();
|
||||
// System.out.println(gp.numVertex());
|
||||
// System.out.println(gp.numEdge());
|
||||
// System.out.println(gp.containsEdge("A", "C"));
|
||||
//
|
||||
// System.out.println(gp.containsEdge("E", "F"));
|
||||
// gp.removeEdge("D", "E");
|
||||
// gp.display();
|
||||
// gp.removeVertex("F");
|
||||
// gp.addVertex("F");
|
||||
// gp.display();
|
||||
// System.out.println(gp.hasPath("A", "F", new HashMap<>()));
|
||||
// System.out.println(gp.dfs("A", "F"));
|
||||
// gp.bft();
|
||||
// gp.dft();
|
||||
// gp.removeEdge("B","C");
|
||||
// gp.removeEdge("F","G");
|
||||
// System.out.println(gp.isConnected());
|
||||
// System.out.println(gp.isCyclic());
|
||||
// System.out.println(gp.isTree());
|
||||
// System.out.println(gp.getConnectedComp());
|
||||
// gp.prims().display();
|
||||
System.out.println(gp.Dijktsra("A"));
|
||||
|
||||
|
||||
|
||||
*/
|
||||
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.HashMap;
|
||||
import java.util.LinkedList;
|
||||
import Heaps.GenericHeap;
|
||||
public class Graph {
|
||||
private class vertex{
|
||||
HashMap<String,Integer> nbrs=new HashMap<>();
|
||||
}
|
||||
HashMap<String,vertex> vertcs;
|
||||
public Graph(){
|
||||
vertcs=new HashMap<>();
|
||||
}
|
||||
public int numVertex() {
|
||||
return this.vertcs.size();
|
||||
}
|
||||
public boolean containsVertex(String vname) {
|
||||
return this.vertcs.containsKey(vname);
|
||||
}
|
||||
public void addVertex(String vname) {
|
||||
|
||||
vertex vtx=new vertex();
|
||||
this.vertcs.put(vname,vtx);
|
||||
}
|
||||
public void removeVertex(String vname) {
|
||||
vertex vtx=this.vertcs.get(vname);
|
||||
ArrayList<String> keys=new ArrayList<>(vtx.nbrs.keySet());
|
||||
for(String key:keys) {
|
||||
vertex nbrvtx=this.vertcs.get(key);
|
||||
nbrvtx.nbrs.remove(vname);
|
||||
}
|
||||
this.vertcs.remove(vname);
|
||||
}
|
||||
|
||||
public int numEdge() {
|
||||
int count=0;
|
||||
ArrayList<String> keys=new ArrayList<>(this.vertcs.keySet());
|
||||
for(String key:keys) {
|
||||
vertex vtx=this.vertcs.get(key);
|
||||
count+=vtx.nbrs.size();
|
||||
}
|
||||
return count/2;
|
||||
}
|
||||
public boolean containsEdge(String vname1,String vname2) {
|
||||
vertex vtx1=this.vertcs.get(vname1);
|
||||
vertex vtx2=this.vertcs.get(vname2);
|
||||
if(vtx1==null||vtx2==null||!vtx1.nbrs.containsKey(vname2))
|
||||
return false;
|
||||
return true;
|
||||
}
|
||||
public void addEdge(String vname1,String vname2,int cost) {
|
||||
vertex vtx1=this.vertcs.get(vname1);
|
||||
vertex vtx2=this.vertcs.get(vname2);
|
||||
if(vtx1==null||vtx2==null||vtx1.nbrs.containsKey(vname2))
|
||||
return;
|
||||
vtx1.nbrs.put(vname2,cost);
|
||||
vtx2.nbrs.put(vname1,cost);
|
||||
}
|
||||
public void removeEdge(String vname1,String vname2) {
|
||||
vertex vtx1=this.vertcs.get(vname1);
|
||||
vertex vtx2=this.vertcs.get(vname2);
|
||||
if(vtx1==null||vtx2==null||!vtx1.nbrs.containsKey(vname2))
|
||||
return;
|
||||
vtx1.nbrs.remove(vname2);
|
||||
vtx2.nbrs.remove(vname1);
|
||||
}
|
||||
|
||||
public void display() {
|
||||
ArrayList<String> keys=new ArrayList<>(this.vertcs.keySet());
|
||||
for(String key:keys) {
|
||||
vertex vtx=this.vertcs.get(key);
|
||||
System.out.println(key+" := "+vtx.nbrs);
|
||||
}
|
||||
}
|
||||
|
||||
public boolean hasPath(String source ,String dest,HashMap<String,Boolean> processed) {
|
||||
processed.put(source, true);
|
||||
if(containsEdge(source,dest)) {
|
||||
return true;
|
||||
}
|
||||
vertex vtx=this.vertcs.get(source);
|
||||
ArrayList<String> keys=new ArrayList<>(vtx.nbrs.keySet());
|
||||
for(String key:keys) {
|
||||
if(!processed.containsKey(key) && hasPath(key,dest,processed))
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
|
||||
}
|
||||
private class pair{
|
||||
String vname;
|
||||
String psf;
|
||||
}
|
||||
public boolean bfs(String source,String dest) { // breadth first search
|
||||
HashMap<String ,Boolean> processed=new HashMap<>();
|
||||
|
||||
LinkedList<pair> queue=new LinkedList<>();
|
||||
pair sp=new pair();
|
||||
sp.vname=source;
|
||||
sp.psf=source;
|
||||
queue.addLast(sp);
|
||||
|
||||
while(!queue.isEmpty()) {
|
||||
pair rp=queue.removeFirst();
|
||||
if(processed.containsKey(rp.vname))
|
||||
continue;
|
||||
processed.put(rp.vname,true);
|
||||
|
||||
if(containsEdge(rp.vname,dest)) {
|
||||
System.out.println(rp.psf+dest);
|
||||
return true;
|
||||
}
|
||||
vertex vtx=this.vertcs.get(rp.vname);
|
||||
ArrayList<String> nbrs=new ArrayList<>(vtx.nbrs.keySet());
|
||||
for(String nbr:nbrs) {
|
||||
if(!processed.containsKey(nbr)) {
|
||||
pair np=new pair();
|
||||
np.vname=nbr;
|
||||
np.psf=rp.psf+nbr;
|
||||
queue.addLast(np);
|
||||
}
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
public boolean dfs(String source,String dest) { //deapth first search
|
||||
LinkedList<pair> stack=new LinkedList<>();
|
||||
HashMap<String,Boolean> processed=new HashMap<>();
|
||||
pair sp=new pair();
|
||||
sp.vname=source;
|
||||
sp.psf=source;
|
||||
stack.addFirst(sp);
|
||||
while(!stack.isEmpty()) {
|
||||
pair rp=stack.removeFirst();
|
||||
if(processed.containsKey(rp.vname))
|
||||
continue;
|
||||
processed.put(rp.vname,true);
|
||||
if(containsEdge(rp.vname,dest)) {
|
||||
System.out.println(rp.psf+dest);
|
||||
return true;
|
||||
}
|
||||
vertex vtx=this.vertcs.get(rp.vname);
|
||||
ArrayList<String > nbrs=new ArrayList<>(vtx.nbrs.keySet());
|
||||
for(String nbr:nbrs) {
|
||||
if(!processed.containsKey(nbr)) {
|
||||
pair np=new pair();
|
||||
np.vname=nbr;
|
||||
np.psf=rp.psf+nbr;
|
||||
stack.addFirst(np);
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
return false;
|
||||
}
|
||||
public void bft() { //breadth first traversal
|
||||
HashMap<String ,Boolean> processed=new HashMap<>();
|
||||
LinkedList<pair> queue=new LinkedList<>();
|
||||
ArrayList<String> keys=new ArrayList<>(this.vertcs.keySet());
|
||||
for(String key:keys) {
|
||||
if(processed.containsKey(key))
|
||||
continue;
|
||||
pair sp=new pair();
|
||||
sp.vname=key;
|
||||
sp.psf=key;
|
||||
queue.addLast(sp);
|
||||
|
||||
while(!queue.isEmpty()) {
|
||||
pair rp=queue.removeFirst();
|
||||
if(processed.containsKey(rp.vname))
|
||||
continue;
|
||||
processed.put(rp.vname,true);
|
||||
|
||||
System.out.println(rp.vname+" via "+rp.psf);
|
||||
|
||||
vertex vtx=this.vertcs.get(rp.vname);
|
||||
ArrayList<String> nbrs=new ArrayList<>(vtx.nbrs.keySet());
|
||||
for(String nbr:nbrs) {
|
||||
if(!processed.containsKey(nbr)) {
|
||||
pair np=new pair();
|
||||
np.vname=nbr;
|
||||
np.psf=rp.psf+nbr;
|
||||
queue.addLast(np);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
public void dft() { //deapt first traversal
|
||||
HashMap<String ,Boolean> processed=new HashMap<>();
|
||||
LinkedList<pair> stack=new LinkedList<>();
|
||||
ArrayList<String> keys=new ArrayList<>(this.vertcs.keySet());
|
||||
for(String key:keys) {
|
||||
pair sp=new pair();
|
||||
sp.vname=key;
|
||||
sp.psf=key;
|
||||
stack.addFirst(sp);
|
||||
|
||||
while(!stack.isEmpty()) {
|
||||
pair rp=stack.removeFirst();
|
||||
if(processed.containsKey(rp.vname))
|
||||
continue;
|
||||
processed.put(rp.vname,true);
|
||||
|
||||
System.out.println(rp.vname+" via "+rp.psf);
|
||||
|
||||
vertex vtx=this.vertcs.get(rp.vname);
|
||||
ArrayList<String> nbrs=new ArrayList<>(vtx.nbrs.keySet());
|
||||
for(String nbr:nbrs) {
|
||||
if(!processed.containsKey(nbr)) {
|
||||
pair np=new pair();
|
||||
np.vname=nbr;
|
||||
np.psf=rp.psf+nbr;
|
||||
stack.addFirst(np);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
public boolean isCyclic() {
|
||||
HashMap<String ,Boolean> processed=new HashMap<>();
|
||||
LinkedList<pair> queue=new LinkedList<>();
|
||||
ArrayList<String> keys=new ArrayList<>(this.vertcs.keySet());
|
||||
for(String key:keys) {
|
||||
if(processed.containsKey(key))
|
||||
continue;
|
||||
pair sp=new pair();
|
||||
sp.vname=key;
|
||||
sp.psf=key;
|
||||
queue.addLast(sp);
|
||||
|
||||
while(!queue.isEmpty()) {
|
||||
pair rp=queue.removeFirst();
|
||||
if(processed.containsKey(rp.vname))
|
||||
return true;
|
||||
processed.put(rp.vname,true);
|
||||
|
||||
vertex vtx=this.vertcs.get(rp.vname);
|
||||
ArrayList<String> nbrs=new ArrayList<>(vtx.nbrs.keySet());
|
||||
for(String nbr:nbrs) {
|
||||
if(!processed.containsKey(nbr)) {
|
||||
pair np=new pair();
|
||||
np.vname=nbr;
|
||||
np.psf=rp.psf+nbr;
|
||||
queue.addLast(np);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
public boolean isConnected() {
|
||||
int flag=0;
|
||||
HashMap<String ,Boolean> processed=new HashMap<>();
|
||||
LinkedList<pair> queue=new LinkedList<>();
|
||||
ArrayList<String> keys=new ArrayList<>(this.vertcs.keySet());
|
||||
for(String key:keys) {
|
||||
if(processed.containsKey(key))
|
||||
continue;
|
||||
flag++;
|
||||
pair sp=new pair();
|
||||
sp.vname=key;
|
||||
sp.psf=key;
|
||||
queue.addLast(sp);
|
||||
|
||||
while(!queue.isEmpty()) {
|
||||
pair rp=queue.removeFirst();
|
||||
if(processed.containsKey(rp.vname))
|
||||
continue;
|
||||
processed.put(rp.vname,true);
|
||||
|
||||
vertex vtx=this.vertcs.get(rp.vname);
|
||||
ArrayList<String> nbrs=new ArrayList<>(vtx.nbrs.keySet());
|
||||
for(String nbr:nbrs) {
|
||||
if(!processed.containsKey(nbr)) {
|
||||
pair np=new pair();
|
||||
np.vname=nbr;
|
||||
np.psf=rp.psf+nbr;
|
||||
queue.addLast(np);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if(flag>=2)
|
||||
return false;
|
||||
else
|
||||
return true;
|
||||
}
|
||||
public boolean isTree() {
|
||||
return !isCyclic()&&isConnected();
|
||||
}
|
||||
public ArrayList<ArrayList<String>> getConnectedComp() {
|
||||
ArrayList<ArrayList<String>> ans=new ArrayList<>();
|
||||
HashMap<String ,Boolean> processed=new HashMap<>();
|
||||
LinkedList<pair> queue=new LinkedList<>();
|
||||
ArrayList<String> keys=new ArrayList<>(this.vertcs.keySet());
|
||||
for(String key:keys) {
|
||||
if(processed.containsKey(key))
|
||||
continue;
|
||||
ArrayList<String> subans=new ArrayList<>();
|
||||
pair sp=new pair();
|
||||
sp.vname=key;
|
||||
sp.psf=key;
|
||||
queue.addLast(sp);
|
||||
|
||||
while(!queue.isEmpty()) {
|
||||
pair rp=queue.removeFirst();
|
||||
if(processed.containsKey(rp.vname))
|
||||
continue;
|
||||
processed.put(rp.vname,true);
|
||||
|
||||
subans.add(rp.vname);
|
||||
|
||||
vertex vtx=this.vertcs.get(rp.vname);
|
||||
ArrayList<String> nbrs=new ArrayList<>(vtx.nbrs.keySet());
|
||||
for(String nbr:nbrs) {
|
||||
if(!processed.containsKey(nbr)) {
|
||||
pair np=new pair();
|
||||
np.vname=nbr;
|
||||
np.psf=rp.psf+nbr;
|
||||
queue.addLast(np);
|
||||
}
|
||||
}
|
||||
}
|
||||
ans.add(subans);
|
||||
}
|
||||
return ans;
|
||||
}
|
||||
private class PrimsPair implements Comparable<PrimsPair>{
|
||||
String vname;
|
||||
String acqvname;
|
||||
int cost;
|
||||
public int compareTo(PrimsPair o) {
|
||||
return o.cost-this.cost;
|
||||
}
|
||||
|
||||
}
|
||||
public Graph prims() {
|
||||
HashMap<String ,PrimsPair> map=new HashMap<>();
|
||||
GenericHeap<PrimsPair> heap=new GenericHeap<>();
|
||||
Graph mst=new Graph();
|
||||
for(String vrtx:this.vertcs.keySet()) {
|
||||
PrimsPair np=new PrimsPair();
|
||||
np.acqvname=null;
|
||||
np.vname=vrtx;
|
||||
np.cost=Integer.MAX_VALUE;
|
||||
heap.add(np);
|
||||
map.put(vrtx, np);
|
||||
}
|
||||
while(!heap.isEmpty()) {
|
||||
PrimsPair rp=heap.remove();
|
||||
map.remove(rp.vname);
|
||||
|
||||
if(rp.acqvname==null) {
|
||||
mst.addVertex(rp.vname);
|
||||
}else {
|
||||
mst.addVertex(rp.vname);
|
||||
mst.addEdge(rp.vname, rp.acqvname, rp.cost);
|
||||
}
|
||||
|
||||
for(String nbr:this.vertcs.get(rp.vname).nbrs.keySet()) {
|
||||
if(map.containsKey(nbr)) {
|
||||
//old cost that is from diff path stored in map
|
||||
int oc=map.get(nbr).cost;
|
||||
// cost that present vname need cost to go to nbr
|
||||
int nc=this.vertcs.get(rp.vname).nbrs.get(nbr);
|
||||
if(nc<oc) {
|
||||
PrimsPair gp=map.get(nbr);
|
||||
gp.acqvname=rp.vname;
|
||||
gp.cost=nc;
|
||||
heap.updatePriority(gp);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
return mst;
|
||||
}
|
||||
|
||||
private class DijktsraPair implements Comparable<DijktsraPair>{
|
||||
String vname;
|
||||
String psf;
|
||||
int cost;
|
||||
public int compareTo(DijktsraPair o) {
|
||||
return o.cost-this.cost;
|
||||
}
|
||||
|
||||
}
|
||||
public HashMap<String,Integer> Dijktsra(String source) {
|
||||
HashMap<String ,DijktsraPair> map=new HashMap<>();
|
||||
GenericHeap<DijktsraPair> heap=new GenericHeap<>();
|
||||
HashMap<String,Integer> ans =new HashMap<>();
|
||||
for(String vrtx:this.vertcs.keySet()) {
|
||||
DijktsraPair np=new DijktsraPair();
|
||||
np.psf="";
|
||||
np.vname=vrtx;
|
||||
np.cost=Integer.MAX_VALUE;
|
||||
if(vrtx==source) {
|
||||
np.cost=0;
|
||||
np.psf=source;
|
||||
}
|
||||
heap.add(np);
|
||||
map.put(vrtx, np);
|
||||
}
|
||||
while(!heap.isEmpty()) {
|
||||
DijktsraPair rp=heap.remove();
|
||||
map.remove(rp.vname);
|
||||
|
||||
ans.put(rp.vname,rp.cost);
|
||||
|
||||
for(String nbr:this.vertcs.get(rp.vname).nbrs.keySet()) {
|
||||
if(map.containsKey(nbr)) {
|
||||
//old cost that is from diff path stored in map
|
||||
int oc=map.get(nbr).cost;
|
||||
// cost that present vname need cost to go to nbr
|
||||
int nc=rp.cost+this.vertcs.get(rp.vname).nbrs.get(nbr);
|
||||
if(nc<oc) {
|
||||
DijktsraPair gp=map.get(nbr);
|
||||
gp.psf=rp.psf+nbr;
|
||||
gp.cost=nc;
|
||||
heap.updatePriority(gp);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
return ans;
|
||||
}
|
||||
|
||||
}
|
||||
@ -1,153 +0,0 @@
|
||||
package DataStructures.Lists;
|
||||
|
||||
/*
|
||||
* This class implements a SinglyLinked List.
|
||||
* A linked list is similar to an array, it hold values.
|
||||
* However, links in a linked list do not have indexes. With
|
||||
* a linked list you do not need to predetermine it's size as
|
||||
* it grows and shrinks as it is edited.
|
||||
*it has functions called mid that gives node at mid
|
||||
* in addn to linked list there is algo that
|
||||
* construct a linked list with alternate sums of linked list
|
||||
* and added to new one and add mid value
|
||||
* i.e sum of first and last value of inital list
|
||||
|
||||
Test Case:
|
||||
|
||||
|
||||
LinkedList LL1 = new LinkedList();
|
||||
Scanner scn=new Scanner(System.in);
|
||||
int numNodes=scn.nextInt();
|
||||
for(int i=0;i<2*numNodes;i++) {
|
||||
LL1.addLast(scn.nextInt());
|
||||
}
|
||||
LL1.display();
|
||||
LinkedList LL2=new LinkedList();
|
||||
LL2.formLL2(LL1);
|
||||
LL2.display();
|
||||
LinkedList LL3=new LinkedList();
|
||||
LL3.formLL3(LL1);
|
||||
LL3.display();
|
||||
Node MID=LL1.midValue();
|
||||
System.out.println(MID.data);
|
||||
LinkedList updLL1=new LinkedList();
|
||||
updLL1.formRes(LL1,LL2,LL3,MID);
|
||||
updLL1.display();
|
||||
updLL1.size();
|
||||
|
||||
*/
|
||||
|
||||
import java.util.*;
|
||||
import java.lang.*;
|
||||
import java.io.*;
|
||||
|
||||
public class LinkedList {
|
||||
|
||||
private class Node{
|
||||
int data;
|
||||
Node next;
|
||||
|
||||
Node(int data) {
|
||||
this.data = data;
|
||||
this.next = null;
|
||||
}
|
||||
}
|
||||
|
||||
private Node head;
|
||||
private Node tail;
|
||||
private int size;
|
||||
|
||||
public LinkedList() {
|
||||
head = null;
|
||||
tail = null;
|
||||
size = 0;
|
||||
}
|
||||
|
||||
public void addLast(int data) {
|
||||
Node newNode = new Node(data);
|
||||
|
||||
if(this.head == null) {
|
||||
this.head = newNode;
|
||||
this.tail = newNode;
|
||||
this.size++;
|
||||
}
|
||||
else {
|
||||
this.tail.next = newNode;
|
||||
this.tail = newNode;
|
||||
this.size++;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
public void display() {
|
||||
Node current = this.head;
|
||||
if(this.head == null) {
|
||||
return;
|
||||
}
|
||||
while(current != null) {
|
||||
System.out.print(current.data + " ");
|
||||
current = current.next;
|
||||
}
|
||||
System.out.println();
|
||||
}
|
||||
|
||||
public void formLL2(LinkedList LL1) {
|
||||
Node current=LL1.head;
|
||||
while(current.next!=null&¤t.next.next!=null) {
|
||||
int sum=current.data+current.next.next.data;
|
||||
this.addLast(sum);
|
||||
current=current.next.next;
|
||||
}
|
||||
}
|
||||
|
||||
public void formLL3(LinkedList LL1) {
|
||||
Node current=LL1.head.next;
|
||||
while(current.next!=null&¤t.next.next!=null) {
|
||||
int sum=current.data+current.next.next.data;
|
||||
this.addLast(sum);
|
||||
current=current.next.next;
|
||||
}
|
||||
}
|
||||
|
||||
public Node mid() {
|
||||
Node slow=this.head;
|
||||
Node fast=this.head;
|
||||
while(fast.next!=null && fast.next.next!=null) {
|
||||
slow=slow.next;
|
||||
fast=fast.next.next;
|
||||
}
|
||||
return slow;
|
||||
}
|
||||
|
||||
public Node midValue() {
|
||||
int sum=this.head.data+this.tail.data;
|
||||
Node mid=new Node(sum);
|
||||
return mid;
|
||||
}
|
||||
|
||||
public void formRes(LinkedList LL1,LinkedList LL2,LinkedList LL3,Node MID) {
|
||||
Node LL1mid=LL1.mid();
|
||||
Node currentLL1=LL1.head;
|
||||
Node currentLL2=LL2.head;
|
||||
Node currentLL3=LL3.head;
|
||||
while(currentLL1!=null) {
|
||||
this.addLast(currentLL1.data);
|
||||
|
||||
if(currentLL2!=null) {
|
||||
this.addLast(currentLL2.data);
|
||||
currentLL2=currentLL2.next;
|
||||
}else if(currentLL1.equals(LL1mid)) {
|
||||
this.addLast(MID.data);
|
||||
}
|
||||
else if(currentLL2==null&¤tLL3!=null) {
|
||||
this.addLast(currentLL3.data);
|
||||
currentLL3=currentLL3.next;
|
||||
}
|
||||
currentLL1=currentLL1.next;
|
||||
}
|
||||
}
|
||||
|
||||
public void size() {
|
||||
System.out.println(this.size);
|
||||
}
|
||||
}
|
||||
@ -1,33 +0,0 @@
|
||||
package test;
|
||||
|
||||
import static org.junit.jupiter.api.Assertions.*;
|
||||
|
||||
import org.junit.jupiter.api.Test;
|
||||
|
||||
class LongestPalindromicSubsequenceTests {
|
||||
|
||||
@Test
|
||||
void test1() {
|
||||
assertEquals(LongestPalindromicSubsequence.LPS(""), "");
|
||||
}
|
||||
|
||||
@Test
|
||||
void test2() {
|
||||
assertEquals(LongestPalindromicSubsequence.LPS("A"), "A");
|
||||
}
|
||||
|
||||
@Test
|
||||
void test3() {
|
||||
assertEquals(LongestPalindromicSubsequence.LPS("BABCBAB"), "BABCBAB");
|
||||
}
|
||||
|
||||
@Test
|
||||
void test4() {
|
||||
assertEquals(LongestPalindromicSubsequence.LPS("BBABCBCAB"), "BABCBAB");
|
||||
}
|
||||
|
||||
@Test
|
||||
void test5() {
|
||||
assertEquals(LongestPalindromicSubsequence.LPS("AAAAAAAAAAAAAAAAAAAAAAAA"), "AAAAAAAAAAAAAAAAAAAAAAAA");
|
||||
}
|
||||
}
|
||||
@ -1,67 +0,0 @@
|
||||
package Misc;
|
||||
|
||||
public class HeapSort {
|
||||
public void sort(int[] arr) {
|
||||
int n = arr.length;
|
||||
|
||||
// Build heap (rearrange array)
|
||||
for (int i = n / 2 - 1; i >= 0; i--)
|
||||
heapify(arr, n, i);
|
||||
|
||||
// One by one extract an element from heap
|
||||
for (int i = n - 1; i >= 0; i--) {
|
||||
// Move current root to end
|
||||
int temp = arr[0];
|
||||
arr[0] = arr[i];
|
||||
arr[i] = temp;
|
||||
|
||||
// call max heapify on the reduced heap
|
||||
heapify(arr, i, 0);
|
||||
}
|
||||
}
|
||||
|
||||
// To heapify a subtree rooted with node i which is
|
||||
// an index in arr[]. n is size of heap
|
||||
void heapify(int[] arr, int n, int i) {
|
||||
int largest = i; // Initialize largest as root
|
||||
int l = 2 * i + 1; // left = 2*i + 1
|
||||
int r = 2 * i + 2; // right = 2*i + 2
|
||||
|
||||
// If left child is larger than root
|
||||
if (l < n && arr[l] > arr[largest])
|
||||
largest = l;
|
||||
|
||||
// If right child is larger than largest so far
|
||||
if (r < n && arr[r] > arr[largest])
|
||||
largest = r;
|
||||
|
||||
// If largest is not root
|
||||
if (largest != i) {
|
||||
int swap = arr[i];
|
||||
arr[i] = arr[largest];
|
||||
arr[largest] = swap;
|
||||
|
||||
// Recursively heapify the affected sub-tree
|
||||
heapify(arr, n, largest);
|
||||
}
|
||||
}
|
||||
|
||||
/* A utility function to print array of size n */
|
||||
static void printArray(int[] arr) {
|
||||
int n = arr.length;
|
||||
for (int i = 0; i < n; ++i)
|
||||
System.out.print(arr[i] + " ");
|
||||
System.out.println();
|
||||
}
|
||||
|
||||
// Driver program
|
||||
public static void main(String args[]) {
|
||||
int arr[] = {12, 11, 13, 5, 6, 7};
|
||||
|
||||
heap_sort ob = new heap_sort();
|
||||
ob.sort(arr);
|
||||
|
||||
System.out.println("Sorted array is");
|
||||
printArray(arr);
|
||||
}
|
||||
}
|
||||
@ -104,10 +104,6 @@ public class Caesar {
|
||||
return c >= 'a' && c <= 'z';
|
||||
}
|
||||
|
||||
/**
|
||||
*
|
||||
* @deprecated TODO remove main and make JUnit Testing
|
||||
*/
|
||||
public static void main(String[] args) {
|
||||
Scanner input = new Scanner(System.in);
|
||||
System.out.println("Please enter the message (Latin Alphabet)");
|
||||
|
||||
@ -9,13 +9,6 @@ import javax.swing.JOptionPane;
|
||||
*/
|
||||
public final class RSA {
|
||||
|
||||
/**
|
||||
* Trivial test program.
|
||||
*
|
||||
* @param args
|
||||
* @deprecated TODO remove main and make JUnit Testing or any other
|
||||
* methodology
|
||||
*/
|
||||
public static void main(String[] args) {
|
||||
|
||||
RSA rsa = new RSA(1024);
|
||||
|
||||
Reference in New Issue
Block a user