Given a list, rotate the list to the right by?k?places, where?k?is non-negative. For example:Given?1->2->3->4->5->NULL?and?k?=?2,return?4->5->1->2->3->NULL. 思考：先首尾連成環，head前進(len-k%len)步，拆環

原題鏈接在這里：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:

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 begin to intersect at node c1. /*** Definition for singly-linked

原題鏈接在這里：https://leetcode.com/problems/remove-k-digits/description/ 題目： Given a non-negative integer?num?represented as a string, remove?k?digits from the number so that the new number is the smallest possible. Note: The length of?nu

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

給定一個只包含數字的字符串，復原它并返回所有可能的 IP 地址格式。 LeetCode、示例: 輸入: "25525511135" 輸出: ["255.255.11.135", "255.255.111.35"] 注：這里是IPV4,用2進制表示的話要32位，用10進制則是4個整數,每個整數大于

bitmasking： 歪打正著，想著跟子集1(沒有重復的元素)差不多,去下重就好了，然后沒排序，然后就出現了重復的子集，然后排下序觀察輸出，然后就好了???，然后發現沒排序重復是因為有的子集包含的元素相同,但元素內順序不一樣 可以

Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array?[?2,1,?3,4,?1,2,1,?5,4],the contiguous subarray?[4,?1,2,1]?has the largest sum =?6. More practice:

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

輸入一個字符串，包含數字或者+,-,(,)，求這個表達式的結果 1.沒有括號時順序執行 2.有括號時先計算括號內的表達式 這里用一個棧來保存遇到括號(之前的表達式的結果，也就是說沒遇到括號之前，按順序正常執行設結果為x，遇到括號之后要先