笔记
超爱小橘
这个作者很懒,什么都没留下…
展开
-
day7
c++/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: //递归解...原创 2020-03-07 20:30:51 · 73 阅读 · 0 评论 -
Day1
python:def twoSum(nums, target): lens = len(nums) j=-1 for i in range(lens): if (target - nums[i]) in nums: if (nums.count(target - nums[i]) == 1)&(target - nums...原创 2020-03-01 20:51:58 · 127 阅读 · 0 评论 -
day 1
nums.index(num2),查找 num2 的索引Pythondef twoSum(nums, target): lens = len(nums) j=-1 for i in range(lens): if (target - nums[i]) in nums: if (nums.count(target - nums[i...原创 2020-03-01 20:49:17 · 116 阅读 · 0 评论