本文包括简单的线性算法和一些数值计算，还会在以后的学习中继续更新
rgb 和 16进制互相转换
function rgb2hex(r,g,b){
return "#" + ((r<<16)+(g<<8)+b).toString(16);
}
function hex2rgb(str){
var arr = str.match(/[0-9a-f]{2}/ig);
return {
r: parseInt(arr[0], 16),
g: parseInt(arr[1], 16),
b: parseInt(arr[2], 16)
};
}
找出整型数组中乘积最大的三个数
var original_array = [-10, -7, -29, -4, -1, -10, -70];
var result = findMPTN(original_array);
console.log(result);
function findMPTN(arr){ //findMaxiumProductorOfThreeNumbers
var len = arr.length;
sorted_arr = arr.sort(function(a,b){return a-b;});
var pro1 = 1, pro2 = sorted_arr[len - 1];
for(var i = 1; i <= 3; i++){
pro1 *= sorted_arr[len - i];
}
pro2 *= sorted_arr[0];
pro2 *= sorted_arr[1];
return pro1 > pro2 ?
[sorted_arr[len - 3], sorted_arr[len - 2], sorted_arr[len - 1]] :
[sorted_arr[0], sorted_arr[1], sorted_arr[len - 1]];
}
判断大括号是否闭合
var expression = "{{}}{}{}"
var expressionFalse = "{}{{}";
console.log(isBalanced(expression)); // true
console.log(isBalanced(expressionFalse)); // false
console.log(isBalanced("")); // true
function isBalanced(exp){
var stack = [];
var arr = exp.split("");
var len = arr.length, cur;
while(cur = arr.shift()){
if(cur === "{") stack.push(cur);
if(cur === "}") stack.pop();
}
if(stack.length !== 0) return false;
return true;
}
使用两个栈实现入队与出队
Array.prototype.enqueue = function(item){
return this.push(item);
};
Array.prototype.dequeue = function(){
var tempStack = [];
var cur, temp;
while(cur = this.pop()){
tempStack.push(cur);
}
temp = tempStack.pop();
while(cur = tempStack.pop()){
this.push(cur);
}
return temp;
};
寻找连续数组中的缺失的多个数
var array = [2, 5, -1, 9, -6, 3, 7];
var result = findLost(array);
console.log(result);
function findLost(arr){
if(arr.length <= 1) return null;
var sortedArr = arr.sort(function(a,b){return a-b;});
var i = sortedArr.shift();
var cur = sortedArr.shift();
var result = [];
do{
i++;
if(cur === i) cur = sortedArr.shift();
else result.push(i);
}while(cur);
return result;
}
数组中元素最大差值计算
给定某无序数组，求取任意两个元素之间的最大差值，注意，这里要求差值计算中较小的元素下标必须小于较大元素的下标。
var array = [7, 8, 4, 9, 9, 15, 3, 1, 10];
var result = findLargestDifference(array);
console.log(result);
function findLargestDifference(arr){
var min = arr[0];
var diff = 0;
for(var i = 1, len = arr.length; i < len; i++){
if(arr[i] < min){
min = arr[i];
continue;
}
if(arr[i] - min > diff){
diff = arr[i] - min;
}
}
return diff;
}
数组中元素乘积
给定某无序数组，要求返回新数组 output ，其中 output[i] 为原数组中除了下标为 i 的元素之外的元素乘积，要求以 O(n) 复杂度实现：
var firstArray = [2, 2, 4, 1];
var secondArray = [0, 0, 0, 2];
var thirdArray = [-2, -2, -3, 2];
console.log(productExceptSelf(firstArray)); // [8, 8, 4, 16]
console.log(productExceptSelf(secondArray)); // [0, 0, 0, 0]
console.log(productExceptSelf(thirdArray)); // [12, 12, 8, -12]
function productExceptSelf(arr){
var result = [];
var pro = 1;
var len = arr.length;
for(var i = 0; i < len; i++){
result.push(pro);
pro *= arr[i];
}
pro = 1;
for(i = len - 1; i >= 0; i--){
result[i] *= pro;
pro *= arr[i];
}
return result;
}
数组扁平化
var arr = [1,2,[1,3,[2,[2,3,3],[2,5]]],[6,3]];
//传统方式
function flat(arr,result=[]){
if(arr.constructor !== Array) return [arr];
var length = arr.length;
arr.forEach(function(item){
if(item.constructor !== Array) result.push(item);
else result = flat(item, result);
});
return result;
}
var flatted = flat(arr);
console.log(flatted); //[1, 2, 1, 3, 2, 2, 3, 3, 2, 5, 6, 3]
//优雅方式
var arr=[1,3,4,5,[6,[0,1,5],9],[2,5,[1,5]],[5]];
var flatter = arr => arr.reduce((a, b) => a.concat(Array.isArray(b) ? flatter(b) : b), []);
console.log(flatter(arr)); //[1, 2, 1, 3, 2, 2, 3, 3, 2, 5, 6, 3]
//另一个方法，简单但有副作用：把数组内的值全部转换成了字符串类型
var flatten = a => a.join().split(',');
console.log(flatten(arr)); //["1", "2", "1", "3", "2", "2", "3", "3", "2", "5", "6", "3"]
查找字符串中出现次数最多的字符及数量
"ababccdeaeajxac".split('').sort().join('').match(/(\w)\1*/g).reduce(function(a,b){ return a.length > b.length ? a : {char: b[0], length: b.length};}, {char: '', length: 0}); //{char: "a", length: 5}
字符串查找
String.prototype.indexOf = String.prototype.indexOf || function(str){
if(str.length > this.length) return -1;
var len = 0;
var _this = this.split(''), str = str.split('');
var lenA = str.length, this_len = this.length;
var temp;
for(var i = 0, j = 0; j < lenA; i = 0, j = temp + 1, len = 0){
debugger;
while(str[i] !== _this[j] && j < this_len){
j++;
}
temp = j;
while(str[i] === _this[j] && j < this_len){
len++;
i++;
j++;
}
if(len === lenA) return temp;
}
return -1;
}
字符串查找(KMP 算法)
String.prototype.indexOf = String.prototype.indexOf || function(str){
var next = [];
var n = this.length;
var m = str.length;
calcNext(str,next);
for (var i = 0,q = 0; i < n; ++i){
while(q > 0 && str[q] != this[i])
q = next[q-1];
if (str[q] === this[i]){
q++;
}
if (q === m){
return i - m + 1;
}
}
return -1;
function calcNext(str){
var m = str.length;
next[0] = 0;
for(var q = 1, k = 0; q < m; ++q){
while(k > 0 && str[q] != str[k])
k = next[k-1];
if (str[q] == str[k]){
k++;
}
next[q] = k;
}
}
}
查看链表是否有环
function hasCircle(head){ //传入链表头
var pos1 = head;
var pos2 = head;
while(pos2){
pos1 = pos1.next;
pos2 = pos2.next !== null ? pos2.next.next : null;
if(pos1 === pos2) return true;
}
return false;
}
求一个数二进制中 1 的个数
function numberOf1(n){
if(n < 0){
n = n >>> 0;
}
var arr = n.toString(2).split('');
return arr.reduce(function(a,b){
return b === "1" ? a + 1 : a;
},0);
}
翻转链表
/*function ListNode(x){
this.val = x;
this.next = null;
}*/
function reverseList(pHead){
var newHead, temp;
if(!pHead){
return null;
}
if(pHead.next === null){
return pHead;
} else {
newHead = ReverseList(pHead.next);
}
temp = pHead.next;
temp.next = pHead;
pHead.next = null;
temp = null;
return newHead;
}
判断是否栈序输出
例如序列1,2,3,4,5是某栈的压入顺序，序列4，5,3,2,1是该压栈序列对应的一个弹出序列，但4,3,5,1,2就不可能是该压栈序列的弹出序列。
function isPopOrder(pushV, popV){
if(!pushV.length || !popV.length){
return false;
}
var temp = [];
var popIndex = 0;
var len = pushV.length;
for(var i = 0; i < len; i++){
temp.push(pushV[i]);
while(temp.length && temp[temp.length - 1] === popV[popIndex]){
temp.pop();
popIndex++;
}
}
return temp.length === 0;
}
获取字符串中字符的全排列(无重复)
function permutation(str){
if(!str || str.length === 0){
return [];
}
var result = [];
var arr = str.split('');
var temp = '';
ordering(arr);
result = result.filter(function(item, index){ //去重
return result.indexOf(item) === index;
});
return result;
function ordering(tempArr){
if(tempArr.length === 0){
result.push(temp);
return;
}
for(var i = 0; i < tempArr.length; i++){
temp += tempArr[i];
insideArr = tempArr.concat();
insideArr.splice(i,1);
ordering(insideArr);
temp = temp.substring(0, temp.length - 1); //回溯
}
}
}
查找有环链表的入环节点
/*function ListNode(x){
this.val = x;
this.next = null;
}*/
function EntryNodeOfLoop(pHead){
if(!pHead){
return null;
}
var meeting = meetingNode(pHead);
if(!meeting){
return null;
}
var nodeLoop = 1;
var node1 = meeting;
while(node1.next != meeting){
node1 = node1.next;
nodeLoop++;
}
node1 = pHead;
for(var i = 0; i < nodeLoop; i++){
node1 = node1.next;
}
var node2 = pHead;
while(node1 != node2){
node1 = node1.next;
node2 = node2.next;
}
return node1;
function meetingNode(node){
if(!node || !node.next){
return null;
}
var slow = node.next;
var fast = slow.next;
while(fast && slow){
if(fast === slow){
return fast;
}
slow = slow.next;
fast = fast.next;
if(fast){
fast = fast.next;
}
}
return null;
}
}
网友评论