回型打印练习

最新推荐文章于 2022-04-05 15:52:18 发布

marlons

最新推荐文章于 2022-04-05 15:52:18 发布

阅读量571

点赞数

文章标签： function html float 算法 path up

本文链接：https://blog.csdn.net/marlons/article/details/6666973

版权

之前写过一次这样回型打印的程序，可是代码不知道丢哪里了。

最新心血来潮，换了个算法重新写了一次。详细分析，就下次在写了。

<?php
/**
 * 面向对象回型字打印
 * @author RaidNight
 * 
 */
class Circle {
	public $path = array ();
	public $_rows;
	public function __construct($rows) {
		$this->_rows = $rows;
		$max = $rows;
		$max_map = array ();
		for($max; $max > 0; $max --) {
			$max_map [] = $max;
			$max_map [] = $max;
		}
		unset ( $max_map [0] );
		$direction_index = - 1;
		$directions = array ('right', 'down', 'left', 'up' );
		$point = array ('x' => - 1, 'y' => 0, 'v' => 0 );
		foreach ( $max_map as $max ) {
			$direction_index ++;
			for($i = 0; $i < $max; $i ++) {
				$point = $this->next ( $point, $directions [$direction_index % 4] );
				$this->path [] = $point;
			}
		}
	}
	
	private function next($point, $direction) {
		switch ($direction) {
			case 'right' :
				$point ['x'] ++;
				break;
			case 'down' :
				$point ['y'] ++;
				break;
			case 'left' :
				$point ['x'] --;
				break;
			case 'up' :
				$point ['y'] --;
				break;
		}
		$point ['v'] ++;
		return $point;
	}
	
	public function to_map() {
		$temp=array();
		foreach ( $this->path as $point ) {
			$temp[$point ['x']] [$point ['y']] = $point ['v'];
		}
		return $temp;
	}
	
	public function to_html(){
		$temp = $this->to_map();
		$html='<ul style="width:'.($this->_rows*40).'px">';
		for($y = 0; $y < $this->_rows; $y ++) {
			for($x = 0; $x < $this->_rows; $x ++) {
				$html .= '<li>' . $temp [$x] [$y] . '</li>';
			}
		}
		return $html.'</ul>';
	}
}
for($i=1;$i<30;$i++){
	$circle = new Circle( $i );
	$html.=$circle->to_html();
	$html.='<hr>';
}
?>

<html>
<head>
<style>
ul li {
	float: left;
	width: 40px;
	height: 40px;
}
hr{clear:both;}
</style>
</head>
<body>
			<?php
			echo $html?>
</body>
</html>

分析补充：