Show Posts
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
It's on the very top of the first post.i got it now its not available on the mobile version so thats why it didnt show up.
I am almost locking this topic, i am sorry, but this is already planned for the next version of evilzone.so this isnt allowed to go on?
Feel free to orgranize un-official things
If there would be someone dedicated to post problems then maybe we could think about it.i'd be more han happy to post problems up weekly, well it would probably have to be every 2 weeks as a week for voting and announcing the programmer of the week.
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;
public class Scrambled {
public static String scrambled_word;
public static ArrayList<String> dictionary = new ArrayList<String>();
public static ArrayList<Character> orig_word = new ArrayList<Character>();
public static ArrayList<Character> array_elem = new ArrayList<Character>();
public static char[] array_elem1 = new char[100];
public static char[] orig_word1 = new char[100];
public static boolean quit = false;
public static void main(String[] args) throws FileNotFoundException, IOException {
try{
BufferedReader in = new BufferedReader(new FileReader("C:\\Users\\Lee\\Documents\\NetBeansProjects\\Lab12\\src\\lab15\\read.txt"));
int add = 0;
while(in.ready()){
dictionary.add(add, in.readLine());
add++;
}
in=null;
}catch(FileNotFoundException e)
{
System.out.println("File not found");
}
while (!quit) {
Scanner s = new Scanner(System.in);
removeElem(orig_word);
removeElem(array_elem);
System.out.println("Enter a string to look for:>");
scrambled_word = s.nextLine();
if (scrambled_word.equalsIgnoreCase("q")) {
quit = true;
} else {
orig_word1 = scrambled_word.toCharArray();
for (int i = 0; i < orig_word1.length; i++) {
orig_word.add(orig_word1[i]);
}
for (int i = 0; i < dictionary.size(); i++) {
if (compare(scrambled_word.length(), dictionary.get(i).length()) == 0) {
array_elem1 = dictionary.get(i).toCharArray();
swap(array_elem1);
if (matchWord()) {
System.out.println(dictionary.get(i) + " is the word you are loooking for");
} else {
}
}
removeElem(array_elem);
}
}
}
}
public static int compare(int a, int b) {
return a - b;
}
public static void swap(char[] words) {
for (int i = 0; i < words.length; i++) {
array_elem.add(words[i]);
}
}
public static void removeElem(ArrayList array) {
for (int i = array.size() - 1; i >= 0; i--) {
array.remove(i);
}
}
public static boolean matchWord() {
// assuming scrambled is aready sorted
int m = 0;
for (int i = 0; i < orig_word.size(); i++) {
for (int j = 0; j < array_elem.size(); j++) {
if (orig_word.get(i) == array_elem.get(j)) {
m = 1;
array_elem.remove(j);
array_elem.trimToSize();
break;
} else {
}
}
if (m == 0) {
return false;
} else {
m = 0;
}
}
return true;
}
}
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;
public class Scrambled {
public static String scrambled_word;
public static ArrayList<String> dictionary = new ArrayList<String>();
public static ArrayList<Character> orig_word = new ArrayList<Character>();
public static ArrayList<Character> array_elem = new ArrayList<Character>();
public static char[] array_elem1 = new char[100];
public static char[] orig_word1 = new char[100];
public static boolean quit = false;
public static void main(String[] args) throws FileNotFoundException, IOException {
while (!quit) {
try{
removeElem(dictionary);
BufferedReader in = new BufferedReader(new FileReader("C:\\Users\\Lee\\Documents\\NetBeansProjects\\Lab12\\src\\lab15\\read.txt"));
int add = 0;
while(in.ready()){
dictionary.add(add, in.readLine());
add++;
}
}catch(FileNotFoundException e)
{
System.out.println("File not found");
}
Scanner s = new Scanner(System.in);
System.out.println("Enter a string to look for:>");
scrambled_word = s.nextLine();
if (scrambled_word.equalsIgnoreCase("q")) {
quit = true;
} else {
orig_word1 = scrambled_word.toCharArray();
for (int i = 0; i < orig_word1.length; i++) {
orig_word.add(orig_word1[i]);
}
for (int i = 0; i < dictionary.size(); i++) {
if (compare(scrambled_word.length(), dictionary.get(i).length()) == 0) {
array_elem1 = dictionary.get(i).toCharArray();
swap(array_elem1);
if (matchWord()) {
System.out.println(dictionary.get(i) + " is the word you are loooking for");
} else {
}
}
removeElem(array_elem);
}
}
}
}
public static int compare(int a, int b) {
return a - b;
}
public static void swap(char[] words) {
for (int i = 0; i < words.length; i++) {
array_elem.add(words[i]);
}
}
public static void removeElem(ArrayList array) {
for (int i = array.size() - 1; i >= 0; i--) {
array.remove(i);
}
}
public static boolean matchWord() {
// assuming scrambled is aready sorted
int m = 0;
for (int i = 0; i < orig_word.size(); i++) {
for (int j = 0; j < array_elem.size(); j++) {
if (orig_word.get(i) == array_elem.get(j)) {
m = 1;
array_elem.remove(j);
array_elem.trimToSize();
break;
} else {
}
}
if (m == 0) {
return false;
} else {
m = 0;
}
}
return true;
}
}
import java.util.ArrayList;
import java.util.Scanner;
public class Scrambled {
public static String scrambled_word;
public static String[] dictionary = {"world", "array", "scrambled", "testing", "scrambley", "largeword", "abitlargerword", "download"};
public static ArrayList<Character> orig_word = new ArrayList<Character>();
public static ArrayList<Character> array_elem = new ArrayList<Character>();
public static char[] array_elem1 = new char[100];
public static char[] orig_word1 = new char[100];
public static boolean quit = false;
public static void main(String[] args) {
while (!quit) {
Scanner s = new Scanner(System.in);
System.out.println("Enter a string to look for:>");
scrambled_word = s.nextLine();
if (scrambled_word.equalsIgnoreCase("q")) {
quit = true;
} else {
orig_word1 = scrambled_word.toCharArray();
for (int i = 0; i < orig_word1.length; i++) {
orig_word.add(orig_word1[i]);
}
for (int i = 0; i < dictionary.length; i++) {
if (compare(scrambled_word.length(), dictionary[i].length()) == 0) {
System.out.println("Testing: " + dictionary[i]);
array_elem1 = dictionary[i].toCharArray();
swap(array_elem1);
if (matchWord()) {
System.out.println(dictionary[i] + " is the word you are loooking for");
} else {
System.out.println("this is not the scrambled word");
}
}
removeElem();
}
}
}
}
public static int compare(int a, int b) {
return a - b;
}
public static void swap(char[] words) {
for (int i = 0; i < words.length; i++) {
array_elem.add(words[i]);
}
}
public static void removeElem() {
for (int i = array_elem.size() - 1; i >= 0; i--) {
array_elem.remove(i);
}
}
public static boolean matchWord() {
// assuming scrambled is aready sorted
int m = 0;
for (int i = 0; i < orig_word.size(); i++) {
for (int j = 0; j < array_elem.size(); j++) {
if (orig_word.get(i) == array_elem.get(j)) {
m = 1;
array_elem.remove(j);
array_elem.trimToSize();
break;
} else {
}
}
if (m == 0) {
return false;
} else {
m = 0;
}
}
return true;
}
}