Leetcode 300. 最长递增子序列（DAY 42) ---- 动态规划学习期

---

原题题目

---

---

代码实现（首刷自解 n^2的时间复杂度 148ms）

---

int lengthOfLIS(int* nums, int numsSize){
    int* dp = (int*)malloc(sizeof(int) * (numsSize)),i,j,max = 1;
    for(i=numsSize-1;i>=0;i--)
    {
        dp[i] = 1;
        for(j=numsSize-1;j>i;j--)
            if(nums[i] < nums[j])   dp[i] = fmax(dp[i],dp[j]+1);
        if(dp[i] > max) max = dp[i];
    }
    return max;
}

---

代码实现（二刷DAY 93 C++ nlogn时间复杂度 8ms）

---

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        vector<int> dp;
        for(const auto& num:nums)
        {
            if(dp.empty())  dp.emplace_back(num);
            else
            {
                auto temp = lower_bound(dp.begin(),dp.end(),num);
                if(temp != dp.end())    *temp = num;
                else   dp.emplace_back(num);
            }
        }
        return dp.size();
    }
};

---

代码实现（三刷自解 C++ DAY 157 8ms）

---

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        vector<int> record;
        for(const auto& num:nums)
        {
            if(record.empty() || record.back() < num)   record.emplace_back(num);
            else
            {
                for(int i=record.size()-1;i>=0;--i)
                {
                    if(num < record[i] && (i==0 || num > record[i-1]))
                    {
                        record[i] = num;
                        break;
                    }
                }
            }
        }
        return record.size();
    }
};

---

代码实现（四刷DAY 183 自解 二分查找）

---

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        vector<int> v;
        for(const auto& num:nums)
        {
            if(v.empty() || num > v.back())   v.emplace_back(num);
            else
            {   
                auto pos = lower_bound(v.begin(),v.end(),num) - v.begin();
                if(pos >= 0) v[pos] = num;
            }
        }
        return v.size();
    }
};

---

代码实现（五刷自解 DAY 211 C++ 未二分优化）

---

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        vector<int> dp{nums[0]};
        int size = nums.size();

        for(int i=1;i<size;++i)
        {
            int num = nums[i],dp_size = dp.size();
            if(num > dp.back())     dp.emplace_back(num);
            else
            {
                for(int j=0;j<dp_size;++j)    
                {
                    if(num < dp[j] && (!j || num > dp[j-1]))
                    {
                        dp[j] = num;
                        break;
                    }
                }
            }
        }
        
        return dp.size();
    }
};

---

代码实现（五刷自解 DAY 211 二分优化）

---

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        vector<int> dp{nums[0]};
        int size = nums.size();

        for(int i=1;i<size;++i)
        {
            int num = nums[i],dp_size = dp.size();
            if(num > dp.back())     dp.emplace_back(num);
            else
            {
                auto iter = lower_bound(dp.begin(),dp.end(),num);
                if(iter != nums.end() && *iter != num)
                    *iter = num;
            }
        }
        
        return dp.size();
    }
};

---

代码实现（六刷自解 DAY 273 C++ 如果要求输出最小字典序路径 下方给出解答）

---

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
      vector<int> ret;
      int pos = 0, size = nums.size();

      while (pos < size) {
        if (ret.empty() || nums[pos] > ret.back()) {
          ret.emplace_back(nums[pos]);
          ++pos; continue;
        } 

        for (int i = ret.size() - 1; i >= 0; --i) {
          if (ret[i] > nums[pos] && (!i || ret[i - 1] < nums[pos])) {
            ret[i] = nums[pos];
            break;
          }
        }
        ++pos;
      }

      return ret.size();
    }
};

---

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
      vector<int> ret;
      vector<int> maxlen(nums.size(), 0);
      vector<int> path(nums.size(), -1);
      int pos = 0, size = nums.size();

      while (pos < size) {
        if (ret.empty() || nums[pos] > nums[ret.back()]) {
          path[pos] = (pos ? ret.back() : -1);
          maxlen[pos] = ret.size() + 1;

          ret.emplace_back(pos);
          ++pos; continue;
        } 

        for (int i = ret.size() - 1; i >= 0; --i) {
          if (nums[ret[i]] > nums[pos] && (!i || nums[ret[i - 1]] < nums[pos])) {
            path[pos] = (i ? ret[i - 1] : -1);
            maxlen[pos] = i + 1;
            
            ret[i] = pos;
            break;
          }
        }
        ++pos;
      }

      int ans = 0, last_idx = 0;
      for (int i = 0; i < maxlen.size(); ++i)
      {
        if (maxlen[i] > ans) {
          last_idx = i;
          ans = maxlen[i];
        }
      }

      do {
        cout << nums[last_idx];
        last_idx = path[last_idx];
        if (last_idx != -1) cout << "->";
      } while (last_idx != -1);

      return ans;
    }
};

---

代码实现（七刷自解 DAY 3 Golang）

---

func lowerbound(nums []int, target int) int {
  left, right := 0, len(nums) - 1
  for left < right {
    mid := ((right - left) >> 1) + left
    if nums[mid] < target {
      left = mid + 1
    } else {
      right = mid
    }
  }
  return left
}

func lengthOfLIS(nums []int) int {
  if len(nums) == 0 {
    return 0
  }

  dp := []int{nums[0]}
  for i := 1; i < len(nums); i++ {
    if nums[i] > dp[len(dp) - 1] {
      dp = append(dp, nums[i])
    } else {
      dp[lowerbound(dp, nums[i])] = nums[i]     
    }
  }
  return len(dp)
}