-
Notifications
You must be signed in to change notification settings - Fork 0
/
longest_increasing_subsequence.cpp
73 lines (65 loc) · 1.63 KB
/
longest_increasing_subsequence.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
/*
* =====================================================================================
*
* Filename: longest_increasing_subsequence.cpp
*
* Description: 300. Longest Increasing Subsequence. Given an unsorted array of
* integers, find the length of longest increasing subsequence.
*
* Version: 1.0
* Created: 07/13/2019 04:56:40 PM
* Revision: none
* Compiler: gcc
*
* Author: YOUR NAME (),
* Organization:
*
* =====================================================================================
*/
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
using std::vector;
class Solution
{
public:
int lengthOfLIS(vector<int>& nums)
{
if (nums.size() < 1)
{
return 0;
}
vector<int> lens(nums.size(), 0);
lens[0] = 1;
int last_max = lens[0];
for (int i = 1; i < nums.size(); i++)
{
lens[i] = 1;
for (int j = 0; j < i; j++)
{
if (nums[j] < nums[i])
{
lens[i] = std::max(lens[j] + 1, lens[i]);
}
}
last_max = std::max(last_max, lens[i]);
}
return last_max;
}
};
int main(int argc, char* argv[])
{
vector<int> nums = {10, 9, 2, 5, 3, 7, 101, 18};
if (argc > 1)
{
nums.clear();
for (int i = 1; i < argc; i++)
{
nums.push_back(atoi(argv[i]));
}
}
auto max_len = Solution().lengthOfLIS(nums);
printf("Length of LIS: %d\n", max_len);
return 0;
}