- 博客(2)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode---1. Two Sum
传送门class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> res; map<int,int> m; for(int i=0;i<nums.size();i++){ m[nums[i]]=i;
2017-04-11 13:58:56
400
原创 Codeforces Round #408 (Div. 2) A Buying A House
传送门#include<stdio.h>#define MAX_N 110int house[MAX_N];int main(){ int n,m,k; scanf("%d%d%d",&n,&m,&k); for(int i=1;i<=n;i++){ scanf("%d",&house[i]); if(house[i]==0)
2017-04-11 10:58:46
405
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人