提交300 最长上升子序列

yllg · yllg · commit b97217674225 · 2020-03-16T14:55:31.000+08:00
diff --git a/300.最长上升子序列/solution.html b/300.最长上升子序列/solution.html
@@ -0,0 +1,50 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Document</title>
+</head>
+<body>
+<script>
+// Source : https://leetcode.com/problems/longest-increasing-subsequence/
+// Author : 悬笔e绝
+// Date   : 2020-03-16
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+
+function binarySearch(a, target) {
+  var start = 0
+    , end = a.length - 1;
+  while(start <= end) {
+    var mid = ~~((start + end) >> 1);
+    if (a[mid] >= target)
+      end = mid - 1;
+    else 
+      start = mid + 1;
+  }
+  return end;
+}
+
+var lengthOfLIS = function(nums) {
+  var a = [];
+  nums.forEach(function(item) {
+    var index = binarySearch(a, item) + 1;
+    if (a[index] === undefined)
+      a[index] = item;
+    else 
+      a[index] = Math.min(a[index], item);
+  });
+  return a.length;
+};
+
+// 测试
+const nums = [10,9,2,5,3,7,101,18]
+console.log(lengthOfLIS(nums));
+
+</script>
+</body>
+</html>
