上一页 1 ··· 9 10 11 12 13 14 15 16 17 ··· 41 下一页
摘要: 21. Merge Two Sorted Lists 21. Merge Two Sorted Lists Total Accepted: 138746 Total Submissions: 383218 Difficulty: Easy Merge two sorted linked lists 阅读全文
posted @ 2016-07-12 22:05 Deribs4 阅读(211) 评论(0) 推荐(0) 编辑
摘要: 371. Sum of Two Integers 371. Sum of Two Integers Total Accepted: 10773 Total Submissions:20732 Difficulty: Easy Calculate the sum of two integers a a 阅读全文
posted @ 2016-07-12 07:31 Deribs4 阅读(324) 评论(0) 推荐(0) 编辑
摘要: 1. 数的原码补码转换 计算机运算中,数都是由补码表示的。正数的补码就是原码;负数的补码就是各位(包括符号位)取反,再加上1。假设数是8位的,最高位为符号位。1的补码是0x00000001,-3的补码是0xFFFFFFFD。 如果由补码转化为原数:正数不变;负数的补码是各位(包括符号位)取反,再加上 阅读全文
posted @ 2016-07-11 22:48 Deribs4 阅读(784) 评论(0) 推荐(0) 编辑
摘要: 373. Find K Pairs with Smallest Sums 373. Find K Pairs with Smallest Sums Total Accepted: 1453 Total Submissions: 5789 Difficulty: Medium You are give 阅读全文
posted @ 2016-07-10 18:29 Deribs4 阅读(1102) 评论(0) 推荐(0) 编辑
摘要: priority_queue本质是一个堆。 1. 头文件是#include<queue> 2. 关于priority_queue中元素的比较 模板申明带3个参数:priority_queue<Type, Container, Functional>,其中Type 为数据类型,Container为保存 阅读全文
posted @ 2016-07-10 15:15 Deribs4 阅读(38032) 评论(1) 推荐(12) 编辑
摘要: 110. Balanced Binary Tree 110. Balanced Binary Tree Total Accepted: 119517 Total Submissions:345415 Difficulty: Easy Given a binary tree, determine if 阅读全文
posted @ 2016-07-09 14:31 Deribs4 阅读(238) 评论(0) 推荐(0) 编辑
摘要: 104. Maximum Depth of Binary Tree 104. Maximum Depth of Binary Tree Total Accepted: 157320 Total Submissions:323303 Difficulty: Easy Given a binary tr 阅读全文
posted @ 2016-07-09 09:54 Deribs4 阅读(154) 评论(0) 推荐(0) 编辑
摘要: 111. Minimum Depth of Binary Tree 111. Minimum Depth of Binary Tree Total Accepted: 114343 Total Submissions:368035 Difficulty: Easy Given a binary tr 阅读全文
posted @ 2016-07-09 09:45 Deribs4 阅读(146) 评论(0) 推荐(0) 编辑
摘要: 64. Minimum Path Sum 64. Minimum Path Sum Total Accepted: 76284 Total Submissions:214404 Difficulty: Medium Given a m x n grid filled with non-negativ 阅读全文
posted @ 2016-07-08 21:45 Deribs4 阅读(196) 评论(0) 推荐(0) 编辑
摘要: 63. Unique Paths II 63. Unique Paths II Total Accepted: 70691 Total Submissions:237311 Difficulty: Medium Follow up for "Unique Paths": Now consider i 阅读全文
posted @ 2016-07-07 21:52 Deribs4 阅读(172) 评论(0) 推荐(0) 编辑
上一页 1 ··· 9 10 11 12 13 14 15 16 17 ··· 41 下一页