{"url":"https://minus9d.hatenablog.com/entry/2017/06/30/235959","blog_url":"https://minus9d.hatenablog.com/","provider_name":"Hatena Blog","provider_url":"https://hatena.blog","blog_title":"minus9d's diary","type":"rich","width":"100%","height":"190","published":"2017-06-30 23:59:00","author_name":"minus9d","image_url":null,"categories":["python"],"description":"100 numpy exercises\u306e\u89e3\u8aac 51~75 - minus9d\u2019s diary \u306e\u7d9a\u304d\u3067\u3059\u3002\u5f15\u304d\u7d9a\u304d\u3001 numpy-100/100 Numpy exercises.ipynb at master \u00b7 rougier/numpy-100 \u00b7 GitHub \u3092\u7247\u624b\u306b\u3054\u89a7\u304f\u3060\u3055\u3044\u3002 76. Consider a one-dimensional array Z, build a two-dimensional array whose first row is (Z[0],Z[1],Z[2]) and each subsequent row is shifted by 1 (last ro\u2026","author_url":"https://blog.hatena.ne.jp/minus9d/","title":"100 numpy exercises\u306e\u89e3\u8aac 76~100","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fminus9d.hatenablog.com%2Fentry%2F2017%2F06%2F30%2F235959\" title=\"100 numpy exercises\u306e\u89e3\u8aac 76~100 - minus9d&#39;s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","version":"1.0"}