first commit Array Stack

Hubbyshell · Hubbyshell · commit 5782d5b3c14f · 2016-07-27T17:13:02.000+08:00
diff --git a/Array/Array.html b/Array/Array.html
@@ -0,0 +1,49 @@
+<!DOCTYPE html>
+<html>
+<head>
+	<meta charset="utf-8">
+	<title>Array</title>
+</head>
+<body>
+	<h3>数组方法总结</h3>
+	<p>
+		<h4>数组合并方法</h4>
+		concat();
+	</p>
+	<p>
+		<h4>搜索和排序</h4>
+		indexOf();
+		lastIndexOf();
+		reverse();
+		sort();
+	</p>
+	<p>
+		<h4>栈方法</h4>
+		push();
+		pop();
+	</p>
+	<p>
+		<h4>堆方法</h4>
+		unshift();
+		shift();
+	</p>
+	<p>
+		<h4>删除方法</h4>
+		slice();
+		splice();
+	</p>
+	<p>
+		<h4>迭代方法</h4>
+		every();
+		some();
+		map();
+		filter();
+		forEach();
+	</p>
+	<p>
+		<h4>归一方法</h4>
+		reduce();
+		rightReduce();
+	</p>
+</body>
+</html>
diff --git a/README.md b/README.md
@@ -0,0 +1 @@
+# Data-Constructs-and-Algorithms
diff --git a/Stack/Stack.html b/Stack/Stack.html
@@ -0,0 +1,65 @@
+<!DOCTYPE html>
+<html>
+<head>
+	<meta charset="utf-8">
+	<title>Algorithms && Data Struct</title>
+	<script type="text/javascript">
+		//Stack
+		function Stack(){
+			var items = [];
+			//进栈
+			this.push = function(element){
+				items.push(element);
+			};
+			//出栈
+			this.pop = function(){
+				return items.pop();
+			};
+			//返回栈顶元素
+			this.peek = function(){
+				return items[items.length - 1];
+			};
+			//栈判空，空返回true，反之返回false
+			this.isEmpty = function(){
+				return items.length == 0;
+			};
+			//清空栈
+			this.clear = function(){
+				items = [];//items.length = 0;
+			};
+			//返回栈中元素个数
+			this.size = function(){
+				return items.length;
+			};
+			//查看栈中元素
+			this.print = function(){
+				console.log(items.toString());
+			};
+		}
+		//十进制转换为其他进制
+		function divideByBase(decNumber,base){
+			var remStack = new Stack();
+			var rem;
+			var binaryString = '';
+			var digits = "0123456789ABCDEF";
+			while(decNumber > 0){
+				rem = Math.floor(decNumber % base);
+				if(base != 16){
+					remStack.push(rem);
+				}else{
+					remStack.push(digits[rem]);
+				}
+				decNumber = Math.floor(decNumber / base);
+			}
+			while(!remStack.isEmpty()){
+				binaryString += remStack.pop().toString();
+			}
+			return binaryString;
+		}
+		console.log(divideByBase(126,8));
+	</script>
+</head>
+<body>
+
+</body>
+</html>
