Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Union of two sorted arrays
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
// Get the union of two sorted arrays. var arr1 = [1, 2, 4, 5]; var arr2 = [2, 3, 6, 7, 8]; var result = []; //output : [1, 2, 3, 4, 5, 6, 7, 8] var i = 0; var j = 0; while(i < arr1.length && j < arr2.length) { if (arr1[i] < arr2[j]) { //console.log(arr1[i]); result.push(arr1[i]); i++; } else if (arr2[j] < arr1[i]) { //console.log(arr2[j]); result.push(arr2[j]); j++; } else { //console.log(arr1[i]); result.push(arr1[1]); i++; j++; } } while(i < arr1.length) { //console.log(arr1[i]); result.push(arr1[i]); i++; } while(j < arr2.length) { //console.log(arr2[j]); result.push(arr2[j]); j++; } console.log(result);
[
+
]
Show input
Absolute running time: 0.51 sec, cpu time: 0.57 sec, memory peak: 15 Mb, absolute service time: 0,52 sec
edit mode
|
history
|
discussion
[ 1, 2, 3, 4, 5, 6, 7, 8 ]