leetcode 题目
文章平均质量分 72
cch13
坚持,不懈怠
展开
-
二叉树的基本遍历算法
基本数据结构struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {}};houxu原创 2014-04-17 10:59:00 · 585 阅读 · 0 评论 -
leetcode Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to原创 2014-05-30 10:42:59 · 435 阅读 · 0 评论 -
leetcode candy
There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least on原创 2014-05-29 23:41:41 · 533 阅读 · 0 评论 -
leetcode LRU Cache
题目大意就是实现一个使用最近最少shiyon原创 2014-04-13 17:04:36 · 599 阅读 · 0 评论 -
leetcode Evaluate Reverse Polish Notation
逆波兰式的求解,主要注意的问题就是,输入的是string数组,需原创 2014-04-13 11:31:24 · 385 阅读 · 0 评论 -
leetcode wordBreak
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet"原创 2014-04-28 16:48:50 · 404 阅读 · 0 评论 -
leetcode Linked List Circle
首先要判断一个链表是否是循环的原创 2014-04-27 20:20:32 · 795 阅读 · 0 评论 -
leetcode Insertion Sort List
题目大意:实现链表的插入排序算法/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution { pu原创 2014-04-12 00:17:55 · 365 阅读 · 0 评论 -
leetcode Max Points on a Line
#include #include #include using namespace std;//自定义的分数 a表示分数 b表示分母class Key{public: int a, b; Key(): a(0), b(0){} Key(int x, int y) : a(x), b(y){} friend bool operator < (co原创 2014-04-12 20:26:02 · 460 阅读 · 0 评论 -
leetcode Sort List
题目的主要大意是对lianbiao/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {publi原创 2014-04-11 11:13:34 · 424 阅读 · 0 评论 -
leetcode Copy List with Random Pointer
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.题目大意:对一个单向链表进行深度拷贝,单向链表的每个结点还有原创 2014-05-06 19:45:56 · 420 阅读 · 0 评论 -
leetcode WordBreak II
题目大意 给定一个单词集合一个z原创 2014-05-06 11:41:54 · 447 阅读 · 0 评论 -
leetcode Jump Game II
ven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is原创 2014-07-06 19:11:43 · 472 阅读 · 0 评论