A_bigUncle的博客

跳格子标签（空格分隔）： bfsDescriptionWx最近在玩一个跳格子的游戏，游戏的规则如下：给出n个格子，每个格子有一个数字x，代表在该位置可以向右跳0-x步，现在Wx需要算出最少的跳跃次数，从最左边的格子跳到最右边的格子，输出跳跃的次数，若跳不到，则输出-1.Intput输入一个t，表示有t组测试数据 对于每组测试数据读入一个n表示格子的个数(2 <=n<=20), 下面一行n个数，

迷宫(BFS)标签： 算法 题目描述You are provided a maze(迷宫), and you need to program to find the least steps to walk from the start to the end.And you can only walk in four directions:up, down,left, right. There wi

LeetCode 854. K-Similar Strings问题描述：Strings A and B are K-similar (for some non-negative integer K) if we can swap the positions of two letters in A exactly K times so that the resulting string equa...