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

Commitc5486fc

Browse files
Rename longest-subsequence to longest-increasing-subsequence.
1 parent2ede1f3 commitc5486fc

File tree

2 files changed

+14
-14
lines changed

2 files changed

+14
-14
lines changed

‎src/searching/longest-subsequence.jsrenamed to‎src/searching/longest-increasing-subsequence.js

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
(function(exports){
22
'use strict';
33

4-
exports.longestSubsequence=(function(){
4+
exports.longestIncreasingSubsequence=(function(){
55

66
/**
77
* Find the index of the first largest element in array.
@@ -57,12 +57,12 @@
5757
}
5858

5959
/**
60-
* Finds the longest sub-sequence for given node.<br><br>
60+
* Finds the longestincreasingsub-sequence for given node.<br><br>
6161
* Complexity: O(N^N).
6262
*@private
6363
*@param {Object} dag Graph represented with list of neighbours.
6464
*@param {number} node The current node.
65-
*@return {object} The longest sub-sequence for given node.
65+
*@return {object} The longestincreasingsub-sequence for given node.
6666
*/
6767
functionfind(dag,node){
6868
node=node||0;
@@ -103,7 +103,7 @@
103103
*
104104
*@example
105105
* var subsequence = require('path-to-algorithms/src/searching/'+
106-
* 'longest-increasing-subsequence').longestSubsequence;
106+
* 'longest-increasing-subsequence').longestIncreasingSubsequence;
107107
* console.log(subsequence([1, 0, 4, 3, 5])); // 1, 4, 5
108108
*
109109
*@public

‎test/searching/longest-subsequence.spec.jsrenamed to‎test/searching/longest-increasing-subsequence.spec.js

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,36 +1,36 @@
11
'use strict';
22

3-
varlongestSubsequence=
3+
varlongestIncreasingSubsequence=
44
require('../../src/searching/'+
5-
'longest-subsequence')
6-
.longestSubsequence;
5+
'longest-increasing-subsequence')
6+
.longestIncreasingSubsequence;
77

8-
describe('longest subsequence',function(){
8+
describe('longestincreasingsubsequence',function(){
99

1010
varsequence;
1111
beforeEach(function(){
1212
sequence=[5,2,8,6,3,6,9,7,11];
1313
});
1414

1515
it('should work with empty array',function(){
16-
expect(longestSubsequence([]).length).toBe(0);
16+
expect(longestIncreasingSubsequence([]).length).toBe(0);
1717
});
1818

1919
it('should return the only element in a single element array',function(){
2020
vararray=[1];
21-
expect(longestSubsequence(array)).toEqual([1]);
21+
expect(longestIncreasingSubsequence(array)).toEqual([1]);
2222
});
2323

2424
it('should give the right length',function(){
25-
expect(longestSubsequence(sequence).length).toBe(5);
25+
expect(longestIncreasingSubsequence(sequence).length).toBe(5);
2626
});
2727

2828
it('should work with empty arrays',function(){
29-
expect(longestSubsequence([]).length).toBe(0);
29+
expect(longestIncreasingSubsequence([]).length).toBe(0);
3030
});
3131

3232
it('should return the correct path',function(){
33-
expect(longestSubsequence(sequence).toString())
33+
expect(longestIncreasingSubsequence(sequence).toString())
3434
.toBe([2,3,6,9,11].toString());
3535
});
3636

@@ -39,7 +39,7 @@ describe('longest subsequence', function () {
3939
returnb-a;
4040
};
4141
varseq=[1,2,-1];
42-
varresult=longestSubsequence(seq,cmp);
42+
varresult=longestIncreasingSubsequence(seq,cmp);
4343
expect(result.length).toBe(2);
4444
expect(result).toEqual([1,-1]);
4545
});

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp