Scribd
Upload
22 views6 pages

Probleme Lab 3 Pitic Emanuel

The document contains code for various problems involving arrays, strings, and file I/O in Java. It includes methods to find the minimum value in an array, check if an array is sorted, calculate the square of array elements, sum the border of a 2D array, count occurrences of a value in a 2D array, replace a character in a string, capitalize the first letter of words in a string, and read from a text file into a buffer.

Uploaded by

emanuel.pitic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
22 views6 pages

Probleme Lab 3 Pitic Emanuel

The document contains code for various problems involving arrays, strings, and file I/O in Java. It includes methods to find the minimum value in an array, check if an array is sorted, calculate the square of array elements, sum the border of a 2D array, count occurrences of a value in a 2D array, replace a character in a string, capitalize the first letter of words in a string, and read from a text file into a buffer.

Uploaded by

emanuel.pitic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 6

import java.util.

Scanner;
import java.io.*;
//TIP To <b>Run</b> code, press <shortcut actionId="Run"/> or
// click the <icon src="AllIcons.Actions.Execute"/> icon in the gutter.
public class Main {
public static void problema1() {
Scanner sc = new Scanner(System.in);
System.out.println("Introduceti numarul de elemente: ");
int n = sc.nextInt();
System.out.println("Numarul introdus este " + n );
if (n > 0)
{
int [] a = new int [n+1];
int i = 1;
System.out.print("Elementul "+i+" este:" );
a[i]=sc.nextInt();
int min=a[1];
for (i=2; i<=n; i++)
{
System.out.print("Elementul "+i+" este:" );
a[i]=sc.nextInt();
if(a[i]<min)
{
min=a[i];
}
}
System.out.println("Valoarea minima din vector este "+min );
}
else {
System.out.println("Valoarea"+n+" este invalida" );
}

}
public static void problema4() {
//4 - sortat
Scanner sc = new Scanner(System.in);
System.out.println("Introduceti numarul de elemente: ");
int n = sc.nextInt();
System.out.println("Numarul introdus este " + n );
if (n > 0) {
int[] a = new int[n + 1];
int i = 1;
boolean ok = true;
System.out.print("Elementul " + i + " este:");
a[i] = sc.nextInt();
for (i = 2; i <= n; i++) {
System.out.print("Elementul " + i + " este:");
a[i] = sc.nextInt();
if (a[i] < a[i - 1])
ok = false;
}
if (ok == true)
{
System.out.println("Sirul este ordonat crescator :)" );
}
else{
System.out.println("Sirul nu este ordonat crescator :(" );
}
}
else
{
System.out.println("Valoarea"+n+" este invalida" );
}

}
public static void problema6() {
//6 - patrat
Scanner sc = new Scanner(System.in);
System.out.println("Introduceti numarul de elemente: ");
int n = sc.nextInt();
System.out.println("Numarul introdus este " + n );
if (n > 0)
{
int[] a = new int[n];
int[] auxiliar = new int[n];
int i;
for (i = 0; i < n; i++) {
System.out.print("Elementul " + i + " este:");
a[i] = sc.nextInt();
auxiliar[i]=a[i]*a[i];
}
for (i = 0; i < n ; i++)
{
System.out.println("Patratul elementului " + a[i] + " este: " +
auxiliar[i]);
}

}
else
{
System.out.println("Valoarea "+n+" este invalida" );
}

public static void problema7()


{
Scanner sc = new Scanner(System.in);
System.out.println("Introduceti numarul de linii: ");
int n = sc.nextInt();
System.out.println("Introduceti numarul de Coloane: ");
int m = sc.nextInt();
int [][] a = new int [n][m];
for ( int i = 0; i < n ; i++)
{
for (int j = 0; j < m; j++) {
System.out.print("Elementul a[" + i + "][" + j + "]:");
a[i][j] = sc.nextInt();
}
}
System.out.println("Matricea citita: ");
for ( int i = 0; i < n ; i++)
{
for (int j = 0; j < m; j++) {
System.out.print(a[i][j] +" ");
}
System.out.println(" ");
}
int s = 0;
for (int i = 0; i<n;i++)
{
s+=a[i][0] + a[i][m-1];
}
for (int i = 1; i<m -1;i++)
{
s+=a[0][i] + a[n-1][i];
}
System.out.println("Suma conturului este: "+s);

public static void problema9()


{
Scanner sc = new Scanner(System.in);
System.out.println("Introduceti numarul de linii: ");
int n = sc.nextInt();
System.out.println("Introduceti numarul de Coloane: ");
int m = sc.nextInt();
int [][] a = new int [n][m];
for ( int i = 0; i < n ; i++)
{
for (int j = 0; j < m; j++) {
System.out.print("Elementul a[" + i + "][" + j + "]:");
a[i][j] = sc.nextInt();
}
}
System.out.println("Matricea citita: ");
for ( int i = 0; i < n ; i++)
{
for (int j = 0; j < m; j++) {
System.out.print(a[i][j] +" ");
}
System.out.println(" ");
}
System.out.println("Valoarea pe care doriti sa o cautati este ");
int x= sc.nextInt();
int s=0;
for ( int i = 0; i < n ; i++)
{
for (int j = 0; j < m; j++) {
if (x==a[i][j])
s++;
}
}
System.out.println("Valoarea "+x+" apare de "+s+" ori");

public static void problema10()


{
Scanner sc = new Scanner(System.in);
System.out.println("Introduceti numarul de linii: ");
int n = sc.nextInt();
System.out.println("Introduceti numarul de Coloane: ");
int m = sc.nextInt();
boolean [][] a = new boolean [n][m];
int max=0;
for ( int i = 0; i < n ; i++)
{
int maxi=0;
for (int j = 0; j < m; j++) {
System.out.print("Elementul a[" + i + "][" + j + "]:");
int aux= sc.nextInt();
if (aux!=0)
{
a[i][j]=true;
maxi++;
}
else
{
a[i][j]=false;
}
}
if (maxi > max)
max = maxi;
}
System.out.println("Matricea citita: ");
for ( int i = 0; i < n ; i++)
{
for (int j = 0; j < m; j++) {
System.out.print(a[i][j] +" ");
}
System.out.println(" ");
}
System.out.println("Numarul maxim de 1 de pe fiecare linie este "+max);
}

public static void problema13()


{
Scanner sc = new Scanner(System.in);
System.out.println("Introduceti sirul initial: ");
String sir1= sc.nextLine();
System.out.println("Introduceti subsirul cautat: ");
String sir2= sc.nextLine();
int a1=sir1.indexOf(sir2);
int s=0;
if (a1 >= 0)
{
s++;
while (a1 != sir1.lastIndexOf(sir2))
{
a1=sir1.indexOf(sir2, a1+1);
s++;
}
}
System.out.println("Numarul de aparitii a "+sir2+ " in "+sir1+" este "+ s);

}
public static void problema14()
{
Scanner sc = new Scanner(System.in);
System.out.println("Introduceti sirul initial: ");
String sir1= sc.nextLine();
System.out.println("Introduceti caracterul de schimbat: ");
String aux = sc.nextLine();
char c= aux.charAt(0);
sir1=sir1.replace(c, '*');
System.out.println("Sirul transformat: "+sir1);
}

public static void problema16()


{
Scanner sc = new Scanner(System.in);
System.out.println("Introduceti sirul initial: ");
String sir1= sc.nextLine();
String [] tokens = sir1.split(" ");
StringBuilder auxiliar= new StringBuilder();
for (String token : tokens)
{
String aux= token.substring(0,1);
aux=aux.toUpperCase();
token=token.substring(1);
auxiliar.append(aux);
auxiliar.append(token);
auxiliar.append(' ');
}
sir1=auxiliar.toString();
System.out.println("Sir final: "+sir1);
}

static String buf="";

public static void citeste(String fisier)


{
int c;
FileReader f= null;
try
{
f = new FileReader(fisier);
while ((c = f.read()) != -1)
//cat timp se mai pot citi caractere din fisier
{
buf = buf + (char)c;
//se citesc caracterele din fisier si se pun in buf
}
f.close(); // se inchide fisierul
}
catch (FileNotFoundException e) { // exceptie : nu s-a gasit fisierul
System.out.println("Fisierul nu a fost gasit");
}
catch (IOException e) //eroare la citirea din fisier
{
System.out.println("Eroare la citire");
}
}
public static void problema20()
{
citeste("text.txt");
System.out.println(buf);
}

public static void main(String[] args) {


problema20();

}
}

You might also like