摘要：Given two wordsword1andword2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the ... 阅读全文

摘要：#include #include using namespace std;bool helper(int row, const vector &m, string s){ if (s.empty()) { return true; } for (int i = 0;... 阅读全文

摘要：给出一棵二叉树，寻找一条路径使其路径和最大，路径可以在任一节点中开始和结束（路径和为两个节点之间所在路径上的节点权值之和）样例给出一棵二叉树： 1 / \ 2 3返回6 1 class Solution { 2 public: 3 /** 4 * ... 阅读全文

摘要：给定一个二叉树，找出所有路径中各节点相加总和等于给定目标值的路径。一个有效的路径，指的是从根节点到叶节点的路径。样例给定一个二叉树，和目标值 = 5: 1 / \ 2 4 / \ 2 3返回：[ [1, 2, 2], [1, 4]]Traverse 1 /** 2 ... 阅读全文

摘要：Closest Number in Sorted ArrayGiven a target number and an integer array A sorted in ascending order, find the indexiin A such that A[i] is closest to... 阅读全文