algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-26 14:04:17 +08:00
Code Issues Packages Projects Releases Wiki Activity

Name and convention changed to Java 8

Browse Source
This commit is contained in:
AKS1996
2017-10-22 18:41:27 +05:30
parent cecf806d48
commit 1c34220b3e
3 changed files with 43 additions and 41 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
Others/PasswordGen.java Normal file
View File

@ -0,0 +1,42 @@
import java.util.Collections;
import java.util.Random;
import java.util.List;
import java.util.ArrayList;
/*
Creates a random password from ASCII letters
author: AKS1996
date: 2017-10-22
*/
class PasswordGen {
public static void main(String args[]){
Random random = new Random();
String upper = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
String lower = "abcdefghijklmnopqrstuvwxyz";
String numbers = "0123456789";
String specialChars = "!@#$%^&*(){}?";
String allChars = upper+lower+numbers+specialChars;
List<Character> letters = new ArrayList<Character>();
for(char c:allChars.toCharArray())
letters.add(c);
// Inbuilt method to randomly shuffle a elements of a list
Collections.shuffle(letters);
int min_length = 8;
int max_length = 16;
String password = "";
// Note that size of the password is also random
for(int i = random.nextInt(max_length-min_length) + min_length; i>0; --i) {
password += letters.get(random.nextInt(letters.size()));
}
System.out.print("Password: " + password);
}
}

60
Others/nested_brackets.java
View File

@ -1,60 +0,0 @@
/*
The nested brackets problem is a problem that determines if a sequence of
brackets are properly nested. A sequence of brackets s is considered properly nested
if any of the following conditions are true:
- s is empty
- s has the form (U) or [U] or {U} where U is a properly nested string
- s has the form VW where V and W are properly nested strings
For example, the string "()()[()]" is properly nested but "[(()]" is not.
The function called is_balanced takes as input a string S which is a sequence of brackets and
returns true if S is nested and false otherwise.
author: akshay sharma
date: 2017-10-17
*/
import java.util.Scanner;
import java.util.Stack;
import java.util.ArrayList;
class nested_brackets {
static boolean is_balanced(char[] S) {
Stack<Character> stack = new Stack<>();
String pair = "";
for (int i = 0; i < S.length; ++i) {
if (S[i] == '(' || S[i] == '{' || S[i] == '[') {
stack.push(S[i]);
} else if (stack.size() > 0) {
// pair = (stack.lastElement() + S[i]);
if (!pair.equals("[]") && !pair.equals("()") && !pair.equals("{}")) {
return false;
}
} else {
return false;
}
}
return stack.isEmpty();
}
static void print(Object a) {
System.out.println(a);
}
public static void main(String args[]) {
try {
Scanner in = new Scanner(System.in);
print("Enter sequence of brackets: ");
String S = in.nextLine();
if (is_balanced(S.toCharArray())) {
print(S + " is balanced");
} else {
print(S + " ain't balanced");
}
in.close();
} catch (Exception e) {
e.toString();
}
}
}

39
Others/password_gen.java
View File

@ -1,39 +0,0 @@
import java.util.Collections;
import java.util.Random;
import java.util.List;
import java.util.ArrayList;
/*
Creates a random password from ASCII letters
author: akshay sharma
date: 2017-10-17
*/
class password_gen {
public static void main(String args[]){
Random random = new Random();
List<Character> letters = new ArrayList<>();
for(char c:"ABCDEFGHIJKLMNOPQRSTUVWXYZ".toCharArray())
letters.add(c);
for(char c:"ABCDEFGHIJKLMNOPQRSTUVWXYZ".toLowerCase().toCharArray())
letters.add(c);
for(char c:"0123456789".toCharArray())
letters.add(c);
for(char c:"!@#$%^&*(){}?".toCharArray())
letters.add(c);
Collections.shuffle(letters);
int min_length = 8;
int max_length = 16;
String password = "";
for(int i= random.nextInt(max_length-min_length) + min_length; i>0; --i) {
password += letters.get(random.nextInt(letters.size()));
}
System.out.print("Password: " + password);
System.out.print("[ If you are thinking of using this passsword, You better save it. ]");
}
}