关于javascript 取文件夹最短不重复资料

Question

问题如标题,


资料如下：


var my_arr = ["/aaa/library","/library/a1", "/library/b2", "/library", "/library/bc", "/aaa/library1"];


如何筛选后得到


/library
/aaa/library
/aaa/library1
的结果呢？

thanks!

Answer 1

引用来自“Bruce_Wu”的评论

引用来自“MixedFlow”的评论

写的比较匆忙，可能还要多测测

var my_arr = ["/aaa/library","/library/a1", "/library/b2", "/library","/library", "/library/bc", "/aaa/library1"];
		
var filterPath = function(arr){
	//sort by the num of '/' in path
	arr.sort(function(a,b){
		var aSlashNum = (a.match(///g) || []).length;
		var bSlashNum = (b.match(///g) || []).length;
		if(aSlashNum === bSlashNum){
			return a.length - b.length;
		}
		return aSlashNum - bSlashNum;
	});
	
	//console.log(arr);
	
	var parentPaths = [];
	for(var i = 0; i < arr.length; i++){
		var cur = arr[i];
		//the root path
		if(cur.lastIndexOf('/') === 0 ){
			if(parentPaths.indexOf(cur) === -1)
				//save the new
				parentPaths.push(cur);
				
			continue;
		}
		
		
		var path = cur.substring(0, cur.lastIndexOf('/'));
		//if the path doesn't contains path in parentPaths;
		if(parentPaths.indexOf(path) === -1){
			parentPaths.push(cur);
		}
		
	}
	
	// may need another sort; I'm not sure
	/*parentPaths.sort(function(a,b){
		return a.length - b.length;
	});
	*/
	return parentPaths;
	
};

var result = filterPath(my_arr);
//print
console.log(result);

Answer 2

引用来自“MixedFlow”的评论

写的比较匆忙，可能还要多测测

var my_arr = ["/aaa/library","/library/a1", "/library/b2", "/library","/library", "/library/bc", "/aaa/library1"];
		
var filterPath = function(arr){
	//sort by the num of '/' in path
	arr.sort(function(a,b){
		var aSlashNum = (a.match(///g) || []).length;
		var bSlashNum = (b.match(///g) || []).length;
		if(aSlashNum === bSlashNum){
			return a.length - b.length;
		}
		return aSlashNum - bSlashNum;
	});
	
	//console.log(arr);
	
	var parentPaths = [];
	for(var i = 0; i < arr.length; i++){
		var cur = arr[i];
		//the root path
		if(cur.lastIndexOf('/') === 0 ){
			if(parentPaths.indexOf(cur) === -1)
				//save the new
				parentPaths.push(cur);
				
			continue;
		}
		
		
		var path = cur.substring(0, cur.lastIndexOf('/'));
		//if the path doesn't contains path in parentPaths;
		if(parentPaths.indexOf(path) === -1){
			parentPaths.push(cur);
		}
		
	}
	
	// may need another sort; I'm not sure
	/*parentPaths.sort(function(a,b){
		return a.length - b.length;
	});
	*/
	return parentPaths;
	
};

var result = filterPath(my_arr);
//print
console.log(result);

Answer 3

写的比较匆忙，可能还要多测测

var my_arr = ["/aaa/library","/library/a1", "/library/b2", "/library","/library", "/library/bc", "/aaa/library1"];
		
var filterPath = function(arr){
	//sort by the num of '/' in path
	arr.sort(function(a,b){
		var aSlashNum = (a.match(///g) || []).length;
		var bSlashNum = (b.match(///g) || []).length;
		if(aSlashNum === bSlashNum){
			return a.length - b.length;
		}
		return aSlashNum - bSlashNum;
	});
	
	//console.log(arr);
	
	var parentPaths = [];
	for(var i = 0; i < arr.length; i++){
		var cur = arr[i];
		//the root path
		if(cur.lastIndexOf('/') === 0 ){
			if(parentPaths.indexOf(cur) === -1)
				//save the new
				parentPaths.push(cur);
				
			continue;
		}
		
		
		var path = cur.substring(0, cur.lastIndexOf('/'));
		//if the path doesn't contains path in parentPaths;
		if(parentPaths.indexOf(path) === -1){
			parentPaths.push(cur);
		}
		
	}
	
	// may need another sort; I'm not sure
	/*parentPaths.sort(function(a,b){
		return a.length - b.length;
	});
	*/
	return parentPaths;
	
};

var result = filterPath(my_arr);
//print
console.log(result);

Answer 4

不知道，js玩的不好

Answer 5

引用来自“杨金焕”的评论

看不出以上筛选后结果的规律。

也不明白所表达。

Answer 6

看不出以上筛选后结果的规律。

也不明白所表达。