Leetcode Algo Day6 | Hashtable Part1

Problem: 242. Valid Anagram

Time: 10min

Method: hashtable -  list

Reflection: To be a valid anagram, each letter can only be used once, so need a hashtable to count the letters. Set() does not work.

Time complexity: O(N)

Space complexity: O(1)

Problem: 349. Intersection of Two Arrays

Time: 2min

Method: hashtable - set

Reflection: set() returns unordered unique elements. Set is easy to implement, but more cost of space and time.

Time complexity: O(N+M)

Space complexity: O(N)

Problem: 202. Happy Number

Time: 

Method: hashtable -  list

Reflection: Hashtable is used to detect cycle. divmod() to get both divident and mode. After each loop, reset n = ssq.

Time complexity: O(logN)

Space complexity: O(logN)

Problem: 1. Two Sum

Time: 5min

Method: hashtable -  dict

Reflection: Quesiton prompt mentions exactly one solution. So can use hashtable to find the target pair by selecting from previously iterated elements in linear time.

Time complexity: O(N)

Space complexity: O(N)

  • 5
    点赞
  • 6
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值