silvimasss
BAN USERWorking code ::
class Node{
Node left, right;
int data;
Node(int data1){
this.data = data1;
left = null;
right = null;
}
}
public class sortedArrayToBinaryTree {
public Node convert(int[] arr, int start, int end){
if(start > end) {
return null;
}
int mid = (start+end)/2;
Node root = new Node(arr[mid]);
root.left = convert(arr, start, mid-1);
root.right = convert(arr, mid+1, end);
return root;
}
public void display(Node root){
if(root != null) {
display(root.left);
System.out.println(root.data);
display(root.right);
}
}
public static void main(String[] args){
sortedArrayToBinaryTree s = new sortedArrayToBinaryTree();
int[] arr = {1,2,3,4,5,6,7,8,9,10};
Node n = s.convert(arr, 0 , arr.length-1);
System.out.println("Display Tree");
s.display(n);
}
}
import java.util.Scanner;
class odd extends Thread
{
int[] number;
odd(int[] num){
this.number = num;
}
@Override
public void run(){
System.out.println("Odd numbers are:");
for (int i=0;i<number.length;i++)
{
if (number[i]%2!=0)
{
System.out.println(i);
}
}
}
}
class even extends Thread{
int[] number;
even(int[] num){
this.number = num;
}
@Override
public void run()
{
System.out.println("Even Numbers are");
for (int i=0; i<number.length; i++)
{
if (number[i]%2==0)
{
System.out.println(i);
}
}
}
}
public class EvenOdNumberThread {
public static void main(String[] args) throws InterruptedException
{
int[] arr = {0,1,2,3,4,5,6,7,8,9,10};
odd odd1=new odd(arr);
even even1=new even(arr);
odd1.start();
Thread.sleep(5000);
even1.start();
}
}
Odd numbers are:
1
3
5
7
9
Even Numbers are
0
2
4
6
8
10
public static String findParagraph(String[] paraArray, String[] wordsArray) {
int plength = paraArray.length;
int wlength = wordsArray.length;
if(plength < wlength ) return null;
HashMap<String, Integer> hmap = new HashMap<String, Integer>();
for(int i=0;i<wlength;i++){
if(hmap.containsKey(wordsArray[i])) {
hmap.put(wordsArray[i], hmap.get(wordsArray[i]) + 1);
}else {
hmap.put(wordsArray[i],1);
}
}
StringBuffer sb = new StringBuffer();
for(int i = 0 ;i<plength;i++){
if(!hmap.isEmpty()) {
System.out.println(" paraArray[i] --> "+paraArray[i]);
sb.append(paraArray[i] + " ");
if(hmap.containsKey(paraArray[i])) {
hmap.remove(paraArray[i]);
System.out.println(" paraArray[i] ***--> "+paraArray[i]);
}
}else{
break;
}
}
System.out.println("SB --> " + sb.toString().trim());
return sb.toString().trim();
}
I/P
====
String[] paraArray = {"alpha", "beta", "gamma", "beta", "aba", "beta", "zeta", "beta", "zen", "cat", "car", "beta", "aba", "beta", "broad"};
String[] wordsArray = {"aba", "beta", "cat", "beta"};
O/P
====
findParagraph--> alpha beta gamma beta aba beta zeta beta zen cat
Using above test inputs.
public static void main(String[] args){
int[] arr = {0, 3, 1, 0, 2, 6, 7, 0};
System.out.println(Arrays.toString(nonZero(arr)));
int[] arr1 = {0, 0, 1, 0, 0, 0};
System.out.println(Arrays.toString(nonZero(arr1)));
int[] arr2 = {0, 3};
System.out.println(Arrays.toString(nonZero(arr2)));
}
public static int[] nonZero(int[] arr) {
int i=0;
int length = arr.length;
int result[] = new int[length];
int j=0;
while(i<length){
if(arr[i] == 0) {
i++;
}else{
result[j++] = arr[i++];
}
}
return result;
}
Results
[3, 1, 2, 6, 7, 0, 0, 0]
[1, 0, 0, 0, 0, 0]
[3, 0]
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class IP {
public static void main(String[] args){
String[] arr = {"192.100.0.0","192.100.111.111", "10.0.0.1","a.b.c.d", "10.0", "999.10.10.1"};
String patternString = "\\d+.\\d+.\\d+.\\d+";
StringBuffer valid1 = new StringBuffer();
StringBuffer invalid1 = new StringBuffer();
for(int i=0;i<arr.length;i++) {
if(validIP((arr[i]),patternString)) {
valid1.append(arr[i]);
}else{
invalid1.append(arr[i]);
}
}
System.out.println("valid --> " + valid1.toString());
System.out.println("invalid --> "+ invalid1.toString());
}
public static boolean validIP(String s, String patternString){
Pattern p = Pattern.compile(patternString);
Matcher m = p.matcher(s);
boolean b = m.matches();
return b;
}
}
Please add the reason for down sizing my code.
- silvimasss March 29, 2018public class CountingSort {
public static void main(String[] args){
int[] arr = {1,1,1,1,1,2,2,2,2,2,3,3,3,3,3,4,4,5,1,1,1,1,1,1,2,2,2,3,3,3,9,9,9,9,9,9,9,9,6,7,8,9,0,4,4,4,4,4,4,4,4,4,4,4,4};
HashMap<Integer, Integer> hm = new HashMap<Integer, Integer>();
for(int i=0;i<arr.length;i++) {
if(hm.containsKey(arr[i])) {
hm.put(arr[i], (hm.get(arr[i]))+1);
}else{
hm.put(arr[i], 1);
}
}
for(Map.Entry<Integer, Integer> entry : hm.entrySet()) {
// System.out.println(entry.getKey() +" - "+ entry.getValue());
int key = entry.getKey();
int value = entry.getValue();
while(value!=0) {
System.out.print(key);
value--;
}
}
}
Taking care of string with odd lenght and even length greater than 4
public class ReplaceWordWithSpaceLengthGreaterthan4 {
public static void main(String[] args){
String strinput = "A persons cant walk in this street";
//System.out.println(replace(strinput));
String t = StringReplace(strinput);
System.out.println(t);
}
public static String StringReplace(String str) {
String temp = "";
String regex = " ";
String[] words = str.split(regex);
StringBuffer sb = new StringBuffer();
for(int i=0;i< words.length;i++) {
int len = words[i].length()/2;
if(words[i].length() >= 4 && words[i].length()%2 == 0){
sb.append(words[i].substring(0, len));
sb.append(' ');
sb.append(words[i].substring(len, words[i].length()));
}else if (words[i].length() >= 4 && words[i].length() % 2 == 1){
sb.append(words[i].substring(0, len));
sb.append(' ');
sb.append(words[i].substring(len+1, words[i].length()));
}else {
sb.append(words[i]);
}
sb.append(' ');
}
return sb.toString();
}
public static int maxprofit(int trades[]){
int profit = 0;
for(int i=0;i<trades.length;i++ ){
if((trades[i] + profit) > profit){
profit = profit + trades[i];
}
}
return profit;
}
Working code
int main(){
int array[] = {18,-18, -53, 53, 4};
int n = sizeof(array)/sizeof(int);
printf("\n Length-- %d --i \n",n);
int max_sum=0;
int sum=0;
for(int i = 0; i <= n; i++) {
sum+=array[i];
if(sum>max_sum){
max_sum=sum;}
else if (sum < 0) {
sum = 0;
}
}
printf("\n -> %d \n",max_sum);
}
~
- silvimasss February 01, 2019