leetcode/two-sum
来源:互联网 发布:java线程与进程的区别 编辑:程序博客网 时间:2024/06/05 06:26
1.暴力破解
#include<iostream>#include<vector>using namespace std;class Solution {public: vector<int> twoSum(vector<int> numbers, int target) { vector<int> index; for (int i=0;i<numbers.size();i++){ for (int j=(i+1);j<numbers.size();j++){ if (numbers[i]+numbers[j]==target){ index.push_back(i); index.push_back(j); } } } return index; }};int main(){ vector<int> nums(11); for (int i=1;i<12;i++){ nums[i-1]=i; } int target = 11; Solution subSolution; for(int j=0;j< ((subSolution.twoSum(nums,target).size()+1)/2);j++){ cout<<"class"<<j+1<<endl; cout<<"the First number is:"<<"num"<<subSolution.twoSum(nums,target)[2*j]<<",value is:"<<nums[ subSolution.twoSum(nums,target)[2*j] ]<<endl; cout<<"the other number is:"<<"num"<<subSolution.twoSum(nums,target)[2*j+1]<<",value is:"<<nums[ subSolution.twoSum(nums,target)[2*j+1] ]<<endl; } return 0;}
0 0
- 【Leetcode】Two Sum (Sum)
- LeetCode: Two Sum
- LeetCode: Two Sum
- [Leetcode] Two Sum
- LeetCode : Two Sum
- Leetcode: Two Sum
- leetcode 46: Two Sum
- [LeetCode] Two Sum
- LeetCode 1 - Two Sum
- Leetcode : Two Sum
- 【leetcode】Two Sum
- [LeetCode]Two Sum
- leetcode Two Sum
- [Leetcode] Two Sum
- [leetcode] Two Sum
- LeetCode - Two Sum
- leetcode之Two Sum
- LeetCode | Two Sum
- Intersection of Two Arrays II
- JAVA按位运算
- 逆序数
- 接口,抽象类以及它们的区别
- (ssl1000)P1001 A+B Problem(c++)
- leetcode/two-sum
- ICDAR2013文本检测算法的衡量方法(二)Rectangle Matching与DetEval
- JVM学习笔记(三)------内存管理和垃圾回收
- QTcpSocket的连续发送数据和连续接收数据
- myeclipse安装SVN插件
- 递归算法
- 阶乘的因式分解(一)
- JVM学习笔记(四)------内存调优
- 面向对象内部类的优缺点