Leetcode:2. Add Two Numbers
2016-04-04 00:53
351 查看
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.
For example,
Given n =
You should return the following matrix:
基本没什么坑,注意进位和一些特殊情况就好了
AC
For example,
Given n =
3,
You should return the following matrix:
[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ] ]
基本没什么坑,注意进位和一些特殊情况就好了
AC
20MS
/** * Definition for singly-linked list. */ typedef struct ListNode Node; struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) { struct ListNode* p1 = l1; struct ListNode* p2 = l2; struct ListNode* ptemp =NULL; struct ListNode* ptail =NULL; struct ListNode* phead = NULL;//(struct ListNode*)malloc(sizeof(ListNode)); int base,s; int prevoius_s =0; while(p1 !=NULL || p2 !=NULL||prevoius_s) { ptemp = (struct ListNode*)malloc(sizeof(Node)); if(phead == NULL) { phead = ptemp; } base = 0; s = 0; if(p1 !=NULL) { base += p1->val; p1 = p1->next; } if(p2!=NULL) { base += p2->val; p2 = p2->next; } base += prevoius_s; if(base > 9) { base = base%10; prevoius_s =1; } else { prevoius_s = 0; } ptemp->val = base; ptemp->next = NULL; if(ptail == NULL) { ptail = ptemp; } else{ ptail->next = ptemp; ptail = ptemp; } } return phead; }
相关文章推荐
- 基础CSS笔记(一)
- Tsinsen A1115 高精度计算
- linux 网络配置
- MySQL 数据库学习笔记 2
- CodeForces 627D Preorder Test(树形DP+二分)
- hadoop中mapreduce程序的几种提交运行模式
- hadoop笔记
- Android动画三:属性动画 (property animation)
- 我理解的X.509
- LPS
- iOS数据回调三大利器——代理、通知与Block
- Python学习笔记(一)
- 【Linux】netdata监控组件
- 关于javascript面向对象之闭包
- cocoaPod导入第三方提示异常"add use_frameworks"
- WebService学习总结(四)——调用第三方提供的webService服务,使用cxf
- Android蓝牙串口通信模板及demo,trick
- 10013---Trail ~ Catalogs
- Unity 屏幕震动效果实现
- Intellij Idea调试功能总结