- 博客(2)
- 收藏
- 关注
RSS订阅原创 leetcode 88
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold add
2016-12-05 22:45:59
246
原创 HD1001
# include int main() { int n, i, sum = 0; while(scanf("%d", &n)!=EOF) { for(i=1; i<=n; ++i) sum = sum + i; printf("%d\n\n", sum); sum = 0;
2016-11-22 22:06:16
257
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人