Merge pull request fnplus#305 from hp250497/master

jenistenxavier · web-flow · commit 259e021c4932 · 2019-10-07T08:31:30.000+05:30
to find first N pure numbers
diff --git a/Algorithms/Maths/Perfect Number/Java/PerfectNumber.java b/Algorithms/Maths/Perfect Number/Java/PerfectNumber.java
@@ -0,0 +1,59 @@
+import java.io.*; 
+import java.util.*; 
+   
+public class PerfectNumber { 
+
+    public static boolean isPalindrome(int n)  
+    {  
+        // if divisible by 11 then true  
+        if (n % 11 == 0)  
+        {  
+            return true;  
+        }  
+      
+        // if not divisible by 11  
+        return false;  
+    }
+	public static void main(String args[]) { 
+		int i,n,j,flag,number;
+		Scanner in = new Scanner(System. in);
+        System.out.println("Input number ");
+        i = in.nextInt();
+   
+        
+			for(n=10;n<=i;n++)
+			{
+				int l=Integer.toString(n).length();
+				if(l%2==0){
+					flag=1;
+					number=n;
+					while(number>0)
+					{
+					    
+						 int digit = number % 10;
+						 if(!(digit==4 || digit==5))
+						 {
+							 flag=0;
+						 }
+						  number=number/10;
+						 
+					}
+					if(flag==1)
+					{
+					    
+						
+						boolean num=isPalindrome(n);
+						
+						if(num)
+						{
+							System.out.println(n);
+						}
+					}
+				}
+				
+				
+			}
+			
+		 
+	}
+}		
diff --git a/Data Structures/Queue/Python/queue.py b/Data Structures/Queue/Python/queue.py
@@ -1,31 +1,110 @@
-class Queue:
+## ARRAY IMPLEMENTATION OF QUEUE ## 
+
+class ArrayQueue:
+    def __init__(self, capacity):
+        self.front = -1
+        self.rear = -1
+        self.capacity = capacity
+        self.arr = [0 for i in range(self.capacity)]
+    
+    def Enqueue(self, data):
+        if self.rear + 1 == self.capacity:
+            print("Can't Insert Queue is Full")
+            return
+        if self.front == -1:
+            self.front = 0
+        self.rear += 1
+        self.arr[self.rear] = data
+        print("Inserted ", data)
+        return
+    
+    def Dequeue(self):
+        if self.front == -1:
+            print("Can't Delete Queue is Empty")
+            return
+        print("Element deleted is ", self.arr[self.front])
+        self.front += 1
+        
+        if self.front > self.rear:
+            self.front = -1
+            self.rear = -1
+    
+    def Display(self):
+        if self.front == -1:
+            print("Queue is Empty")
+            return
+        for i in range(self.front, self.rear + 1, 1):
+            print(self.arr[i], end = " ")
+        print()
+
+## LINKED LIST IMPLEMENTATION OF QUEUE ##
+
+class Node:
+    def __init__(self, data):
+        self.data = data
+        self.next = None
+
+class LLQueue:
     def __init__(self):
-        self.items = []
- 
-    def is_empty(self):
-        return self.items == []
- 
-    def enqueue(self, data):
-        self.items.append(data)
- 
-    def dequeue(self):
-        return self.items.pop(0)
- 
- 
-q = Queue()
-while True:
-    print('enqueue <value>')
-    print('dequeue')
-    print('quit')
-    do = input('What would you like to do? ').split()
- 
-    operation = do[0].strip().lower()
-    if operation == 'enqueue':
-        q.enqueue(int(do[1]))
-    elif operation == 'dequeue':
-        if q.is_empty():
-            print('Queue is empty.')
+        self.front = None
+        self.rear = None
+    
+    def Enqueue(self, data):
+        data_node = Node(data)
+        if self.rear == None:
+            self.front = data_node
+            self.rear = data_node
         else:
-            print('Dequeued value: ', q.dequeue())
-    elif operation == 'quit':
-        break
+            self.rear.next = data_node
+            self.rear = data_node
+        print("Inserted ", data)
+        return
+    
+    def Dequeue(self):
+        if self.front == None:
+            print("Can't Delete. Queue is Empty")
+            return
+        node_value = self.front.data
+        self.front = self.front.next
+        if self.front == None:
+            self.rear = None
+        print("Deleted ", node_value)
+    
+    def Display(self):
+        if self.front == None:
+            print("Queue is Empty")
+            return
+        it = self.front
+        while it != None:
+            print(it.data, end = " ")
+            it = it.next
+        print()
+
+if __name__ == "__main__":
+    queue = ArrayQueue(6)
+    queue.Enqueue(2)
+    queue.Enqueue(3)
+    queue.Enqueue(4)
+    queue.Enqueue(5)
+    queue.Enqueue(6)
+    queue.Display() #Output: 2 3 4 5 6
+    queue.Dequeue()
+    queue.Dequeue()
+    queue.Dequeue()
+    queue.Dequeue()
+    queue.Dequeue()
+    queue.Display() #Output: Queue is Empty
+    queue = LLQueue()
+    queue.Enqueue(2)
+    queue.Enqueue(3)
+    queue.Enqueue(4)
+    queue.Enqueue(5)
+    queue.Enqueue(6)
+    queue.Display() #Output: 2 3 4 5 6
+    queue.Dequeue()
+    queue.Dequeue()
+    queue.Dequeue()
+    queue.Dequeue()
+    queue.Dequeue()
+    queue.Display() #Output: Queue is Empty
+        
