• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    Kth Missing Positive Number

    less than 1 minute read

    <-E 1539> Kth Missing Positive Number

    class Solution {
    public:
        int findKthPositive(vector<int>& arr, int k) {
            int index = 0;
            for(int i = 1; i != arr.back(); i++) {
                if(i == arr[index])
                    index++;
                else
                    k--;
                if(k == 0)
                    return i;
            }
            return arr.back() + k;    
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: December 24, 2020

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.