Skip to content

Added Important Algos #1322

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

Merged
deadshotsb merged 16 commits into from
May 25, 2020
Merged

Added Important Algos #1322

Changes from 1 commit
Commits
Show all changes
16 commits
Select commit Hold shift + click to select a range
627115b
Created Graph Algos
Ritik2604 May 22, 2020
278529e
Create SinglyLinkedList
Ritik2604 May 23, 2020
4842a4c
Update and rename SinglyLinkedList to ListAddnFun
Ritik2604 May 23, 2020
ef2be07
Create AVLSimple
Ritik2604 May 23, 2020
07aee8b
Create BoardPath
Ritik2604 May 23, 2020
e717f96
Create CountNumBinaryStrings
Ritik2604 May 23, 2020
9a8ccea
Delete LinkedList.java
Ritik2604 May 23, 2020
3a234f0
Delete Node.java
Ritik2604 May 23, 2020
01d5814
Create Intersection
Ritik2604 May 23, 2020
1ef46db
Update GraphAlgos
Ritik2604 May 24, 2020
f710f3a
Update ListAddnFun
Ritik2604 May 24, 2020
82e2132
Update AVLSimple
Ritik2604 May 24, 2020
920852a
Update BoardPath
Ritik2604 May 24, 2020
94cfab0
Update BoardPath
Ritik2604 May 24, 2020
ec4f6a1
Update CountNumBinaryStrings
Ritik2604 May 24, 2020
a23a17b
Update Intersection
Ritik2604 May 24, 2020
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
Prev Previous commit
Next Next commit
Update ListAddnFun
  • Loading branch information
@Ritik2604
Ritik2604 authored May 24, 2020
commit f710f3aafac8be42219c1be4ed7dbfa03c878b4b
41 changes: 41 additions & 0 deletions DataStructures/Lists/ListAddnFun
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,44 @@
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.*;
Expand Down