Leetcode 240: Search a 2D Matrix

January 2, 2017

Problem statement

Introduction

Study the code written in two solutions, first one is time complexity O(log(m*n)) using binary search and second one using binary search is O(logm + logn).

Workout

Study C++ code first.