码迷,mamicode.com
首页 >  
搜索关键字:turn the corner    ( 27676个结果
webrtc 之 sip trickle ice
本文原创自 http://blog.csdn.net/voipmaker  转载注明出处。 webrtc 客户端建立通话的过程中通过交互 candidate实现nat穿越,如果这些交互的candidate在offer/anwser的sdp里面携带会导致通过建立时间很慢, 因为webrtc客户端需要和stun/turn服务器通信获取这些candidate,整个过程是block的,为提高通话建...
分类:Web程序   时间:2015-03-29 10:49:41    阅读次数:395
HDU 2438 Turn the corner (计算几何 + 三分)
HDU 2438 Turn the corner (计算几何 + 三分)...
分类:其他好文   时间:2015-03-21 23:01:24    阅读次数:186
LeetCode --- 71. Simplify Path
题目链接:Simplify Path Given an absolute path for a file (Unix-style), simplify it. For example, path = "/home/", => "/home" path = "/a/./b/../../c/", => "/c" Corner Cases: Did you consider the ca...
分类:其他好文   时间:2015-03-20 22:00:16    阅读次数:168
[LeetCode] Unique Paths 不同的路径
A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ...
分类:其他好文   时间:2015-03-20 16:02:09    阅读次数:160
LeetCode – Refresh – Letter Combination of a Phone Number
This is just a combination. Use hashtable to hold the number ==> charsnotes:1. check corner case : input is empty, do not return vector contains empty...
分类:其他好文   时间:2015-03-20 08:03:21    阅读次数:127
LeetCode – Refresh – Jump Game
Need a corner case check for only one element [0]. 1 class Solution { 2 public: 3 bool canJump(int A[], int n) { 4 if (n = n-1) return tru...
分类:其他好文   时间:2015-03-20 06:51:03    阅读次数:127
LeetCode – Refresh – Fraction to Recurring Decimal
Notes:1. When numerator is 0, return "0". Check this corner case, because 0 / -5 will return -0.2. Use long long int for divd and divs, mainly for div...
分类:其他好文   时间:2015-03-19 23:44:46    阅读次数:162
[LeetCode] Simplify Path 简化路径
Given an absolute path for a file (Unix-style), simplify it.For example,path="/home/", =>"/home"path="/a/./b/../../c/", =>"/c"click to show corner cas...
分类:其他好文   时间:2015-03-18 15:22:54    阅读次数:137
HackerRank - Almost Sorted
Nothing special, just some corner casesn = int(input())arr = [int(i) for i in input().strip().split()]# Collect rec = []i = 0while i arr[i + 1]: ...
分类:其他好文   时间:2015-03-18 06:26:21    阅读次数:92
[Leetcode]Unique Paths
A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ...
分类:其他好文   时间:2015-03-17 23:32:49    阅读次数:138
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!