0% found this document useful (0 votes)
5 views5 pages

Coding (Written)

The document appears to be a fragmented code or pseudocode related to data structures and string manipulations in programming. It includes references to arrays, strings, collections like ArrayList and LinkedList, and various methods for manipulating these data types. The content is disorganized and lacks coherent structure, making it difficult to extract specific functionality or context.

Uploaded by

appifella35
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views5 pages

Coding (Written)

The document appears to be a fragmented code or pseudocode related to data structures and string manipulations in programming. It includes references to arrays, strings, collections like ArrayList and LinkedList, and various methods for manipulating these data types. The content is disorganized and lacks coherent structure, making it difficult to extract specific functionality or context.

Uploaded by

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

Aray

’ 1 t - 4by tes

sor Hing hrays st


’ searchi ng rays. blaavySeaveh (ay) 65
comparinhvays, de epEquals (amijaay,
-Avays . cquals,(an! ia);#a .& (
’ Same

Ahiays.l Canr 5);
’ length alength ;
new int[ 53

29 - ntCL] a = new int [53 I5]

*stings
i)6.eharÁHCnden)
int-i
Stg-s sig-t
5,Comþare To ( stin ant Str)
i) S.conc at (S)

i) s. contai ns (^ "):
) s. ea uals (st);
) skaty )
s. inden of( ) : ( ") 3 \ndenaf (',ntfrem
vi) s. is Empty:
vi) s. length (;
) S. eplace ( old chan , neweher); ehhce l( ).
(''p'):
() i.3):
substingl sb.
(3,): At
Chan set sb. *)
sb. i)
sb, vi)
Strngl)();charft
sting)2 sb.
to vi)
neverse
(); sb. vi)
" "): i,j. 7eplare( sb. ))
(st, ntyfeque
(1); charAt delete sb.
min .
t) collecbons.
man (í,): tedele sb. )
nevenie thons. collec ): (i, insert sb. i)
t)
); ld(ar Bastring
? ildey Stng
Bu
new sb
>inpat Builder sth'in *
(chav)
Char[3. valueof S.CharAray
()i to s.<v)
") ("Wth starts S. )
dt hpatteen)sdasthdevof
(')
osyanlda
UpperCase CaseC)
t S. Lowe t Sci)
enclads ineludy
end)s Stost. substring
( S. xi)
substring
)? s.
.add(ele) is- *
- Arrayllst
- -
bst 1ist.
L3nkedList Linked
13st istc tst l'st. (inden)
gettst naytist
set(inde*
,ele)
ot. Deslean Oouble
dd si NumericValue(l5)
aeter.2et
add entans clea 2
e &
st () () parse
(ale Tntegtr
stiing
le) (ele
Dauble
)
list tist
- Ci12
bst.
new
new Ly4")
to
binkedlist fhray

deuloleole
<>0:
empty
ele.
nt
emave
Linkedltes() -qcontans
(ele).
nt) î
nul
eloesn't hrayel,
mae. ve
etun
cdont
ne
(F
but tifmceen) to
& vetieve.
ve tiere nes head 4
etne -
FirstC)
emeve
I t-l>t.
.
(nde).
get
rêmove
Lat() ne
gtit()
t- t.List.
get (a:
tains
Ist.com - -
Lait() q
Inteqei) -
remove
ment)-
addlast)
l-ist ()3 C) );
(ele3' -
e ek (poll (ele)
qacld - )k(
z po!)
q-
pe
13st,sì
list.
¿
Queue
q:ofte pee
-qele
Queue
(3t 4:
- - - -
-1,
rmowmg Case
-
tLoeCae
0.
hoitten
(). ve tauppe
stacke>
withaut e)n.
to d
base
tun
new tusn)
toh e)
oe
eh)s0lgit( .sLetter
O.Digit)
etun ( ()
s oue isDigt l.
sLowerase
()
s.com
tainslele
).
lchar har
Integerd em s.
isEmpty
() anehCele) .sletterC)
n
)ele -
s.
to
fmayc) C
Shace
s.
clear
()
characte.
- peek() Character
(
push ()
stack< e is
Stack se e
s.s)
S.
s
* - - *
-

You might also like