まさきち

<h2 id="leetcode">
<a class="header-anchor-link" href="#leetcode" aria-hidden="true"></a> Leetcode</h2>
<iframe id="zenn-embedded__64b3129310c71" src="https://embed.zenn.studio/card#zenn-embedded__64b3129310c71" data-content="https%3A%2F%2Fleetcode.com%2Fproblemset%2F" frameborder="0" scrolling="no" loading="lazy"></iframe><a href="https://leetcode.com/problemset/" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://leetcode.com/problemset/</a>
 
<h2 id="atcoder">
<a class="header-anchor-link" href="#atcoder" aria-hidden="true"></a> Atcoder</h2>
<iframe id="zenn-embedded__a1f7ceb1889e7" src="https://embed.zenn.studio/card#zenn-embedded__a1f7ceb1889e7" data-content="https%3A%2F%2Fatcoder.jp%2F%3Flang%3Dja" frameborder="0" scrolling="no" loading="lazy"></iframe><a href="https://atcoder.jp/?lang=ja" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://atcoder.jp/?lang=ja</a>
 
<h2 id="paiza">
<a class="header-anchor-link" href="#paiza" aria-hidden="true"></a> Paiza</h2>
<iframe id="zenn-embedded__3759c1e43afe9" src="https://embed.zenn.studio/card#zenn-embedded__3759c1e43afe9" data-content="https%3A%2F%2Fpaiza.jp%2Fchallenges" frameborder="0" scrolling="no" loading="lazy"></iframe><a href="https://paiza.jp/challenges" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://paiza.jp/challenges</a>
 
<h2 id="type-challange">
<a class="header-anchor-link" href="#type-challange" aria-hidden="true"></a> Type-Challange</h2>
<iframe id="zenn-embedded__5fde4f92e0173" src="https://embed.zenn.studio/github#zenn-embedded__5fde4f92e0173" data-content="https%3A%2F%2Fgithub.com%2Ftype-challenges%2Ftype-challenges%2Fblob%2Fmain%2FREADME.ja.md" frameborder="0" scrolling="no" loading="lazy"></iframe><a href="https://github.com/type-challenges/type-challenges/blob/main/README.ja.md" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://github.com/type-challenges/type-challenges/blob/main/README.ja.md</a>

<h3 id="1.-tow-sum">
<a class="header-anchor-link" href="#1.-tow-sum" aria-hidden="true"></a> 1. Tow sum</h3>
<div class="code-block-container"><pre><code>Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.

Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:
</code></pre></div> 
回答
<div class="code-block-container"><pre class="language-ts"><code class="language-ts">function twoSum(nums: number[], target: number): number[] {
 let output: Map&lt;number, number&gt; = new Map();
 for (let i = 0; i &lt; nums.length; i++) {
 const complement = target - nums[i];
 if (output.has(complement)) {
 return [output.get(complement), i];
 }
 output.set(nums[i], i);
 }
 return []
}
</code></pre></div>Time complexity: O(n2) 
Space complexity: O(1)
<iframe id="zenn-embedded__25237cdb4394" src="https://embed.zenn.studio/card#zenn-embedded__25237cdb4394" data-content="https%3A%2F%2Fleetcode.com%2Fproblems%2Ftwo-sum%2Feditorial%2F" frameborder="0" scrolling="no" loading="lazy"></iframe><a href="https://leetcode.com/problems/two-sum/editorial/" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://leetcode.com/problems/two-sum/editorial/</a>
 
<ul>
<li>O記法（オーダー記法）</li>
</ul>
<iframe id="zenn-embedded__1d850ae213fc5" src="https://embed.zenn.studio/card#zenn-embedded__1d850ae213fc5" data-content="https%3A%2F%2Fqiita.com%2Fasksaito%2Fitems%2F59e0d48408f1eab081b5%23%3A~%3Atext%3D%25E3%2581%2593%25E3%2581%25A8%25E3%2582%2592%25E6%258C%2587%25E3%2581%2599%25E3%2580%2582-%2CO%25E8%25A8%2598%25E6%25B3%2595%25EF%25BC%2588%25E3%2582%25AA%25E3%2583%25BC%25E3%2583%2580%25E3%2583%25BC%25E8%25A8%2598%25E6%25B3%2595%25EF%25BC%2589%2C%25E7%259A%2584%25E3%2581%25AA%25E3%2582%25AA%25E3%2583%25BC%25E3%2583%2580%25E3%2583%25BC%25E3%2582%2592%25E3%2581%25BE%25E3%2581%25A8%25E3%2582%2581%25E3%2582%258B%25E3%2580%2582" frameborder="0" scrolling="no" loading="lazy"></iframe><a href="https://qiita.com/asksaito/items/59e0d48408f1eab081b5#:~:text=%E3%81%93%E3%81%A8%E3%82%92%E6%8C%87%E3%81%99%E3%80%82-,O%E8%A8%98%E6%B3%95%EF%BC%88%E3%82%AA%E3%83%BC%E3%83%80%E3%83%BC%E8%A8%98%E6%B3%95%EF%BC%89,%E7%9A%84%E3%81%AA%E3%82%AA%E3%83%BC%E3%83%80%E3%83%BC%E3%82%92%E3%81%BE%E3%81%A8%E3%82%81%E3%82%8B%E3%80%82" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://qiita.com/asksaito/items/59e0d48408f1eab081b5#:~:text=ことを指す。-,O記法（オーダー記法）,的なオーダーをまとめる。</a>
<ul>
<li>Map</li>
</ul>
<iframe id="zenn-embedded__1766a45f819c6" src="https://embed.zenn.studio/card#zenn-embedded__1766a45f819c6" data-content="https%3A%2F%2Fdeveloper.mozilla.org%2Fja%2Fdocs%2FWeb%2FJavaScript%2FReference%2FGlobal_Objects%2FMap" frameborder="0" scrolling="no" loading="lazy"></iframe><a href="https://developer.mozilla.org/ja/docs/Web/JavaScript/Reference/Global_Objects/Map" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://developer.mozilla.org/ja/docs/Web/JavaScript/Reference/Global_Objects/Map</a>
Object： 攻撃者がオブジェクトのプロトタイプを上書きできる可能性があり、 オブジェクトインジェクション攻撃 につながる可能性 
Mapは関数、keyはオブジェクト、あらゆるプリミティブを格納することが可能。
 
プログラムの計算量を求める
<iframe id="zenn-embedded__961ffd39f8ade" src="https://embed.zenn.studio/card#zenn-embedded__961ffd39f8ade" data-content="https%3A%2F%2Fqiita.com%2Fcotrpepe%2Fitems%2F1f4c38cc9d3e3a5f5e9c" frameborder="0" scrolling="no" loading="lazy"></iframe><a href="https://qiita.com/cotrpepe/items/1f4c38cc9d3e3a5f5e9c" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://qiita.com/cotrpepe/items/1f4c38cc9d3e3a5f5e9c</a>

<h2 id="add-two-numbers">
<a class="header-anchor-link" href="#add-two-numbers" aria-hidden="true"></a> Add Two Numbers</h2>
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Input: l1 = [2,4,3], l2 = [5,6,4] 
Output: [7,0,8] 
Explanation: 342 + 465 = 807.
 
ListNode(連結リスト)とは、データ構造の一種であるリストの中で、自分の次、および、前の要素を示す情報（リンク情報）を持つこと。
<iframe id="zenn-embedded__98ae4191544ec" src="https://embed.zenn.studio/card#zenn-embedded__98ae4191544ec" data-content="https%3A%2F%2Fqiita.com%2FSaayaman%2Fitems%2F657689d6f2cc99048dca" frameborder="0" scrolling="no" loading="lazy"></iframe><a href="https://qiita.com/Saayaman/items/657689d6f2cc99048dca" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://qiita.com/Saayaman/items/657689d6f2cc99048dca</a>