leetcode
saikor1024
这个作者很懒,什么都没留下…
展开
-
Reverse Words in a String
Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". ke原创 2014-09-10 23:37:43 · 671 阅读 · 0 评论 -
Linked List Cycle
Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 最初的da原创 2014-09-12 00:28:48 · 641 阅读 · 0 评论 -
Evaluate Reverse Polish Notation
Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another expression. Some examples: ["2", "1",原创 2014-09-15 13:21:11 · 491 阅读 · 0 评论 -
Linked List Cycle II
Give Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up: Can you solve it without using extra space?原创 2014-09-15 12:19:23 · 604 阅读 · 0 评论 -
Insertion Sort List
Sort a linked list using insertion sort. 对一个原创 2014-09-16 18:26:47 · 647 阅读 · 0 评论 -
Word Search
Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically原创 2015-04-01 19:12:14 · 451 阅读 · 0 评论 -
Unique Paths & Unique Paths II
Unique Paths:m*n的格子,从左上角到右下角,总共多少条不同路线。。。 采用深搜或用stack存储要访问的格子会导致TLE,这里采用dp的方式,依据: grid[x][y]=grid[x-1][y]+grid[x][y-1] class Solution { private: int grid[100][100]; public: int uniqueP原创 2015-04-01 19:24:02 · 676 阅读 · 0 评论