leetcode medium
小小码农JACK
这个作者很懒,什么都没留下…
展开
-
leetcode62 Unique Paths(medium)\ leetcode63 Unique Paths II
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bo...原创 2018-11-27 22:02:39 · 145 阅读 · 0 评论 -
实现pow(a,n)----a的n次方
def power(a,n): if n==0: return 1 res,temp=1,a while n: if n&1: res*=temp n>>=1 print("n:",n) temp*=temp return resprint(...原创 2019-07-08 20:13:38 · 893 阅读 · 0 评论