Get the First Positive Value that Does not Exist in Array (Javascript)
function solution(A) {
var len = A.length;
if(len > 1){
var max = Math.max.apply(null, A);
var range = Array.from(Array(max).keys());
for(let i = 0; i < range.length; i++){
if(A.includes(range[i]) === false){
if(range[i] > 0){
return range[i];
}
continue;
}
continue;
}
return max + 1;
}else if(len == 1 && (A[0] < 1 || A[0] > 1)){
return 1;
}else if((len == 1) && (A[0] == 1)){
return 2;
}
return 1;
}
This is mainly used to get the first positive value that does not exist in sequence of integers in an array
There is a time complexity of (O(N ** 2)).
Can it be better than this?
If there is no better complexity, can we optimize the for loop better than that?
javascript algorithm
New contributor
add a comment |
function solution(A) {
var len = A.length;
if(len > 1){
var max = Math.max.apply(null, A);
var range = Array.from(Array(max).keys());
for(let i = 0; i < range.length; i++){
if(A.includes(range[i]) === false){
if(range[i] > 0){
return range[i];
}
continue;
}
continue;
}
return max + 1;
}else if(len == 1 && (A[0] < 1 || A[0] > 1)){
return 1;
}else if((len == 1) && (A[0] == 1)){
return 2;
}
return 1;
}
This is mainly used to get the first positive value that does not exist in sequence of integers in an array
There is a time complexity of (O(N ** 2)).
Can it be better than this?
If there is no better complexity, can we optimize the for loop better than that?
javascript algorithm
New contributor
add a comment |
function solution(A) {
var len = A.length;
if(len > 1){
var max = Math.max.apply(null, A);
var range = Array.from(Array(max).keys());
for(let i = 0; i < range.length; i++){
if(A.includes(range[i]) === false){
if(range[i] > 0){
return range[i];
}
continue;
}
continue;
}
return max + 1;
}else if(len == 1 && (A[0] < 1 || A[0] > 1)){
return 1;
}else if((len == 1) && (A[0] == 1)){
return 2;
}
return 1;
}
This is mainly used to get the first positive value that does not exist in sequence of integers in an array
There is a time complexity of (O(N ** 2)).
Can it be better than this?
If there is no better complexity, can we optimize the for loop better than that?
javascript algorithm
New contributor
function solution(A) {
var len = A.length;
if(len > 1){
var max = Math.max.apply(null, A);
var range = Array.from(Array(max).keys());
for(let i = 0; i < range.length; i++){
if(A.includes(range[i]) === false){
if(range[i] > 0){
return range[i];
}
continue;
}
continue;
}
return max + 1;
}else if(len == 1 && (A[0] < 1 || A[0] > 1)){
return 1;
}else if((len == 1) && (A[0] == 1)){
return 2;
}
return 1;
}
This is mainly used to get the first positive value that does not exist in sequence of integers in an array
There is a time complexity of (O(N ** 2)).
Can it be better than this?
If there is no better complexity, can we optimize the for loop better than that?
javascript algorithm
javascript algorithm
New contributor
New contributor
New contributor
asked 8 mins ago
Mostafa A. Hamid
11
11
New contributor
New contributor
add a comment |
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Mostafa A. Hamid is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f210348%2fget-the-first-positive-value-that-does-not-exist-in-array-javascript%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Mostafa A. Hamid is a new contributor. Be nice, and check out our Code of Conduct.
Mostafa A. Hamid is a new contributor. Be nice, and check out our Code of Conduct.
Mostafa A. Hamid is a new contributor. Be nice, and check out our Code of Conduct.
Mostafa A. Hamid is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f210348%2fget-the-first-positive-value-that-does-not-exist-in-array-javascript%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown