Advertisement
Guest User

Untitled

a guest
Apr 18th, 2019
110
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.61 KB | None | 0 0
  1. class Solution {
  2. public int[] twoSum(int[] nums, int target) {
  3. HashMap<Integer, Integer> stuff = new HashMap<>();
  4. for (int i=0; i<nums.length; i++){
  5. stuff.put(nums[i], i);
  6. }
  7.  
  8. for (int i=0; i<nums.length; i++){
  9. if (stuff.containsKey(target-nums[i]) ){
  10. int otherIndex = stuff.get(target-nums[i]);
  11. if (i == otherIndex){
  12. continue;
  13. }
  14. int returnVal[] = {i, otherIndex};
  15. return returnVal;
  16. }
  17. }
  18. return null;
  19. }
  20. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement