Java
//candy problem
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
System.out.println("Hello World");
@SuppressWarnings("resource")
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] arr = new int[n];
boolean[] ansarr = new boolean[n];
ansarr[0]= true;
for (int i = 0; i < n; i++) {
arr[i]= input.nextInt();
arr[i] = arr[i] +3;
}
for (int i = 1; i < ansarr.length; i++) {
if (arr[i]>arr[i-1]) {
ansarr[i]= true;
}
else{
ansarr[i]= false;
}
}
System.out.println(Arrays.toString(ansarr));
}
}
import java.util.Scanner;
import java.util.Arrays;
class Solution {
public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
System.out.println("Enter the number of kids:");
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] candies = new int[n];
System.out.println("Enter the number of extracandies:");
int extraCandies = input.nextInt();
System.out.println("Enter the number of candies of each kid:");
for (int i = 0; i < candies.length; i++) {
candies[i] = input.nextInt();
candies[i] = candies[i] + extraCandies;
}
boolean[] arr = new boolean[n];
arr[0] = true;
for (int i = 1; i < length.candies; i++) {
if (candies[i] > candies[i - 1]) {
arr[i] = true;
} else {
arr[i] = false;
}
}
System.out.println(Arrays.toString(arr));
}
}
//linear search
import java.util.Scanner;
public class linearSearch {
public static void main(String[] args) {
System.out.println("Enter the length of array:");
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] arr = new int[n];
System.out.println("Enter the elements of array:");
for (int i = 0; i < arr.length; i++) {
arr[i]= input.nextInt();
}
System.out.println("Enter the key you want to search:");
int key = input.nextInt();
int i =0;
while (arr[i]!=key) {
i++;
}
if (key==-1) {
System.out.println("The element is not present in the array:");
}
else{
System.out.println("The element is found at index: "+i);
}
}
}
//running sumimport java.util.Arrays;
import java.util.Scanner;
public class runningSum {
public static void main(String[] args) {
System.out.println("Enter the length of array:");
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] arr = new int[n];
System.out.println("Enter the elements of array:");
for (int i = 0; i < arr.length; i++) {
arr[i]= input.nextInt();
}
int[] ansarr = new int[n];
int sum =0;
for (int i = 0; i < ansarr.length; i++) {
sum = sum+arr[i];
ansarr[i]= sum;
}
System.out.println(Arrays.toString(ansarr));
}
}
//smaller than the currentimport java.util.Arrays;
import java.util.Scanner;
public class smallerThanTheCurrent {
public static void main(String[] args) {
System.out.println("Enter the length of array:");
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int[] arr = new int[n];
System.out.println("Enter the elements of array:");
for (int i = 0; i < arr.length; i++) {
arr[i]= input.nextInt();
}
int[] ansarr = new int[n];
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < ansarr.length&&j!=i; j++) {
if(arr[i]>arr[j]){
ansarr[i]=j;
}
}
}
System.out.println(Arrays.toString(ansarr));
}
}
Comments
Post a Comment