題目： A message containing letters from A-Z is being encoded to numbers using the following mapping way: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Beyond that, now the encoded string can also contain the character ‘*’, whic

原題鏈接在這里：https://leetcode.com/problems/word-ladder/ leetcode70。題目： 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:

題目連接 https://leetcode.com/problems/course-schedule-ii/?? Course Schedule II Description There are a total of n courses you have to take, labeled from 0 to n - 1. leetcode 課程表？Some courses may have prerequisites, for example to take course 0 you ha

Intersection of Two Linked Lists: Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1 → a2↘c1 → c2 → c3↗ B: b1 → b2 → b3 leetcode121，begin to intersect at

傳送門 Description Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example:Given num = 16, return true. Given num = 5, return false. Follow up: Could you solve it without loops/recursion? 思路 題意：不

題目如下： Python代碼： def isPalindrome(self, x):""":type x: int:rtype: bool"""if(x>=0):s = int(str(x)[::-1])if(x==s):return Trueelse:return Falseelse:return False leetcode 53？? 轉載于:https://www.c

1、基于0001/01/01 是星期一的事實 class Solution {string weeks[7] = {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};int d[2][12]= {{31,28,31,30,31,30,31,31,30,3

原文：https://leetcode-cn.com/problems/wiggle-subsequence/solution/bai-dong-xu-lie-by-leetcode/ 給定一個整數序列，返回作為擺動序列的最長子序列的長度，通過從原始序列中刪除一些（也可以不刪除）元素來獲得子序列，剩下的元素保

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of?every?node never differ by more than 1. 思考：求二叉樹高的變形，加上

Description: Implement pow(x,?n). 分析： 求冪次運算，典型的分治算法來解。 因為pow(x,n/2)*pow(x,n/2) 有著重復運算，分治法就會非常快O(log n) 1 class Solution { 2 public: 3 double findval(double x,int n) 4 { 5 if(n==0) return 1; 6 i