Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commitdfecd2a

Browse files
Add C++ implementation
Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>
1 parent018c984 commitdfecd2a

File tree

3 files changed

+68
-0
lines changed

3 files changed

+68
-0
lines changed
Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
all:
2+
gcc -O1 -otest lis.c
Lines changed: 41 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
#include<stdio.h>
2+
#include<stdlib.h>
3+
4+
5+
staticintbinary_search(int*nums,intlo,inthi,inttarget)
6+
{
7+
while (lo+1<hi) {
8+
intmid=lo+ (hi-lo) /2;
9+
if (nums[mid]<target) {
10+
lo=mid;
11+
}else {
12+
hi=mid;
13+
}
14+
}
15+
returnhi;
16+
}
17+
18+
intlengthOfLIS(int*nums,intnumsSize){
19+
inti,piles=0;
20+
int*tops=malloc(numsSize*sizeof(int));
21+
for (i=0;i<numsSize;i++) {
22+
intpos=binary_search(tops,-1,piles,nums[i]);
23+
if (pos==piles) {
24+
piles++;
25+
}
26+
tops[pos]=nums[i];
27+
}
28+
returnpiles;
29+
}
30+
31+
intmain(intargc,char**argv)
32+
{
33+
inti;
34+
int*nums=malloc((argc-1)*sizeof(int));
35+
for (i=0;i<argc-1;i++) {
36+
nums[i]=atoi(argv[i+1]);
37+
}
38+
39+
printf("%d\n",lengthOfLIS(nums,argc-1));
40+
return0;
41+
}
Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
#include<bits/stdc++.h>
2+
3+
usingnamespacestd;
4+
5+
classSolution {
6+
public:
7+
intlengthOfLIS(vector<int>& nums) {
8+
vector<int>dp(nums.size(),1);
9+
for (int i =0; i < nums.size(); i++) {
10+
for (int j =0; j < i; j++) {
11+
if (nums[j] < nums[i] && dp[j] +1 > dp[i]) {
12+
dp[i] = dp[j] +1;
13+
}
14+
}
15+
}
16+
17+
int res =0;
18+
for (int i : dp) {
19+
if (i > res) {
20+
res = i;
21+
}
22+
}
23+
return res;
24+
}
25+
};

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp