zoukankan      html  css  js  c++  java
  • two sum

    Question 1:

    Given an array of integers, find two numbers such that they add up to a specific target number.

    The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

    You may assume that each input would have exactly one solution.

    Input: numbers={2, 7, 11, 15}, target=9
    Output: index1=1, index2=2

    Answer:

    1.排序后,用两个指针从前后开始查。时间复杂度o(nlgn),结果是over time

    快排:

    public static void quickSort(int[] sum, int begin, int end) {

      int left = begin;

      int right = end;

      int base = sum[end];

      while (left < right){

         while (left < right && sum[left] <= base) {

          ++left;

         }

         sum[right] = sum[left];

        while (left < right && sum[right] >= base) {

           --right;

        }

        sum[left] = sum[right];

      }

      sum[left] = base;

      quickSort(sum, begin, left - 1);

      quickSort(sum, left + 1, end);

    }

    2、借助于Hash表,用空间换时间。

    hash可以用o(1)的复杂度判断一个元素是否在hashmap里。将数据中的数据保存在hash表中,判断target-now是否在target中出现过。

    code:

    public class Solution {
        public int[] twoSum(int[] numbers, int target) {
            HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
            int result[] = new int[2];
            for (int i = 0; i < numbers.length; ++i) {
                int now = numbers[i];
                int dis = target  - now;
                if (map.containsKey(dis)) {
                    int index = map.get(dis) + 1;
                    result[0] = index;
                    result[1] = i + 1;
                    break;
                } else {
                    map.put(now, i);
                }
            }
            return result;
        }
    }
    

    AC

  • 相关阅读:
    实现 AD 采样,使用 LCD1602 显示 AD 数值
    数据结构(C语言)—排序
    Keil uVision4 创建51单片机工程
    51单片机 方波
    51单片机串口中断实验
    51单片机 中断控制蜂鸣器
    串口通信
    定时器与计数器
    中断系统
    《web前端设计基础——HTML5、CSS3、JavaScript》 张树明版 简答题简单整理
  • 原文地址:https://www.cnblogs.com/changxiaoxiao/p/3732052.html
Copyright © 2011-2022 走看看