dario.sonego@gmail.com esercicci_array > cercaPrimaPos
prev  |  next  |  chance

Dato un vettore v ed un numero da cercare q, determinare la prima posizione dove appare q. Se il vettore non contiene il numero cercato, la funzione restituisce -1. cercaPrimaPos([12, 55, 4, 55], 12) → 0 cercaPrimaPos([12, 55, 4, 55], 33) → -1 cercaPrimaPos([12, 55, 4, 55], 55) → 1 Go...Save, Compile, Run (ctrl-enter) int cercaPrimaPos(int[] v, int q) { } Go Editor font size %:75100125150 Shorter output

Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

• Java Example Solution Code
• Java String Introduction (video)
• Java Substring v2 (video)
• Java String Equals and Loops
• Java String indexOf and Parsing
• Java If and Boolean Logic
•   If Boolean Logic Example Solution Code 1 (video)
•   If Boolean Logic Example Solution Code 2 (video)
• Java For and While Loops
• Java Arrays and Loops
• Java Map Introduction
• Java Map WordCount
• Java Functional Mapping
• Java Functional Filtering

Misc Code Practice

• Code Badges
• Introduction to Mod (video)
• MakeBricks problem and solution (video x 2)
• FizzBuzz the famous code interview question (video)

Difficulty: 250

Copyright Nick Parlante 2017 - privacy