惊鸿化飞雪的博客

0. 题目描述 Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n. 给定一个正整数n，找出最少个完全平方数，它们的和为n,返回个数 [点击此处跳转题目原地址](https://leetcode.com/...

0.题目描述 Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that: Only one letter can be changed...

0. 题目描述 此题延续127Word Ladder I ，区别在于，127只需要返回最短路径的步数，而本题目需要返回所有最短路径的路径信息。本文给出两种采用广度优先遍历的方法。 示例1： Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log",&